Kevin J. Compton

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2009
i1		Kevin J. Compton, Brian Timm, Joel VanLaven: A Simple Power Analysis Attack on the Serpent Key Schedule. IACR Cryptology ePrint Archive 2009: 473 (2009)
	2006
j21		Hosung Song, Kevin J. Compton, William C. Rounds: SPHIN: A model checker for reconfigurable hybrid systems based on SPIN. Electr. Notes Theor. Comput. Sci. 145: 167-183 (2006)
	2005
j20		Olgica Milenkovic, Kevin J. Compton: Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs. Algorithmica 43(3): 211-244 (2005)
c11		Joel VanLaven, Mark Brehob, Kevin J. Compton: Side Channel Analysis, Fault Injection and Applications - A Computationally Feasible SPA Attack on AES via Optimized Search. SEC 2005: 577-588
	2004
j19		Olgica Milenkovic, Kevin J. Compton: Probabilistic Transforms for Combinatorial Urn Models. Combinatorics, Probability & Computing 13(4-5): 645-675 (2004)
c10		Wuwei Shen, Mohsen Guizani, Zijiang Yang, Kevin J. Compton, James Huggins: Execution of A Requirement Model in Software Development. IASSE 2004: 203-208
	2003
j18		Olgica Milenkovic, T. S. Coffey, Kevin J. Compton: The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. IEEE Transactions on Information Theory 49(3): 740-746 (2003)
c9		Wuwei Shen, Kevin J. Compton, James Huggins: A Method of Implementing UML Virtual Machines With Some Constraints Based on Abstract State Machines. APSEC 2003: 224-
	2002
c8		Wuwei Shen, Kevin J. Compton, James Huggins: A Toolset for Supporting UML Static and Dynamic Model Checking. COMPSAC 2002: 147-152
	2001
p1		Kevin J. Compton, Howard Straubing: Characterizations of Regular Languages in Low Level Complexity Classes. Current Trends in Theoretical Computer Science 2001: 235-246
c7		Wuwei Shen, Kevin J. Compton, James Huggins: A UML Validation Toolset Based on Abstract State Machines. ASE 2001: 315-318
	1999
j17		Kevin J. Compton: A van der Waerden Variant. Electr. J. Comb. 6 (1999)
j16		Edward A. Bender, Kevin J. Compton, L. Bruce Richmond: 0-1 laws for maps. Random Struct. Algorithms 14(3): 215-237 (1999)
c6		Kevin J. Compton, Scott Dexter: Proof Techniques for Cryptographic Protocols. ICALP 1999: 25-39
	1996
j15		Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53(2): 283-297 (1996)
	1995
j14		Kevin J. Compton, Chinya V. Ravishankar: Expected Deadlock Time in a Multiprocessing System. J. ACM 42(3): 562-583 (1995)
	1994
j13		Kevin J. Compton: Stratified Least Fixpoint Logic. Theor. Comput. Sci. 131(1): 95-120 (1994)
c5		Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. Structure in Complexity Theory Conference 1994: 255-266
	1993
j12		Kevin J. Compton: A Deductive System for Existential Least Fixpoint Logic. J. Log. Comput. 3(2): 197-213 (1993)
c4		Kevin J. Compton, Rosario Uceda-Sosa: The Model Theory of Concurrency. CSL 1993: 78-90
	1992
j11		Kevin J. Compton, Howard Straubing: Characterizations of regular languages in low level complexity classes. Bulletin of the EATCS 48: 134-142 (1992)
j10		David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien: Regular Languages in NC¹. J. Comput. Syst. Sci. 44(3): 478-499 (1992)
c3		Thomas Behrendt, Kevin J. Compton, Erich Grädel: Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. CSL 1992: 43-60
c2		Serge Abiteboul, Kevin J. Compton, Victor Vianu: Queries Are Easier Than You Thought (Probably). PODS 1992: 23-32
	1991
j9		Kevin J. Compton: Lower Bounds for the Complexity of Theories. Bulletin of the EATCS 43: 113-123 (1991)
	1990
j8		Kevin J. Compton, C. Ward Henson: A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Ann. Pure Appl. Logic 48(1): 1-79 (1990)
j7		Kevin J. Compton, Claude Laflamme: An Algebra and a Logic for NC¹. Inf. Comput. 87(1/2): 240-262 (1990)
j6		Kevin J. Compton, Carlos H. Montenegro: The largest set partitioned by a subfamily of a cover. J. Comb. Theory, Ser. A 54(2): 296-303 (1990)
	1989
j5		Kevin J. Compton: A logical approach to asymptotic combinatorics II: Monadic second-order properties. J. Comb. Theory, Ser. A 50(1): 110-131 (1989)
	1988
j4		Kevin J. Compton: The Computational Complexity of Asymptotic Problems I: Partial Orders. Inf. Comput. 78(2): 108-123 (1988)
c1		Kevin J. Compton, Claude Laflamme: An Algebra and a Logic for NC¹. LICS 1988: 12-21
	1987
j3		Kevin J. Compton: Some methods for computing component distribution probabilities in relational structures. Discrete Mathematics 66(1-2): 59-77 (1987)
	1984
j2		Kevin J. Compton: An Undecidable Problem in Finite Combinatorics. J. Symb. Log. 49(3): 842-850 (1984)
	1983
j1		Kevin J. Compton: Some Useful Preservation Theorems. J. Symb. Log. 48(2): 427-440 (1983)

Coauthor Index

1	Serge Abiteboul	[c2]
2	David A. Mix Barrington	[j10]
3	Thomas Behrendt	[c3]
4	Edward A. Bender	[j16]
5	Mark Brehob	[c11]
6	T. S. Coffey	[j18]
7	Scott Dexter	[c6]
8	Erich Grädel	[j15] [c5] [c3]
9	Mohsen Guizani	[c10]
10	C. Ward Henson	[j8]
11	James Huggins	[c10] [c9] [c8] [c7]
12	Claude Laflamme	[j7] [c1]
13	Olgica Milenkovic	[j20] [j19] [j18]
14	Carlos H. Montenegro	[j6]
15	Chinya V. Ravishankar	[j14]
16	L. Bruce Richmond	[j16]
17	William C. Rounds	[j21]
18	Wuwei Shen	[c10] [c9] [c8] [c7]
19	Hosung Song	[j21]
20	Howard Straubing	[p1] [j11] [j10]
21	Denis Thérien	[j10]
22	Brian Timm	[i1]
23	Rosario Uceda-Sosa	[c4]
24	Joel VanLaven	[i1] [c11]
25	Victor Vianu	[c2]
26	Zijiang Yang	[c10]

Colors in the list of coauthors

Last update Fri May 24 16:51:56 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page