SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Kevin J. Compton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.032secs, Finished in 0.034secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP