Kevin J. Compton

According to our database, Kevin J. Compton authored at least 37 papers between 1983 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

A Simple Power Analysis Attack on the Twofish Key Schedule.

Jose Javier Gonzalez Ortiz, Kevin J. Compton

CoRR, 2016

2013

Detecting Traditional Packers, Decisively.

Denis Bueno, Kevin J. Compton, Karem A. Sakallah, Michael D. Bailey

Proceedings of the Research in Attacks, Intrusions, and Defenses, 2013

2009

A Simple Power Analysis Attack on the Serpent Key Schedule.

Kevin J. Compton, Brian Timm, Joel VanLaven

IACR Cryptol. ePrint Arch., 2009

2005

SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.

Hosung Song, Kevin J. Compton, William C. Rounds

Proceedings of the 5th International Workshop on Automated Verification of Critical Systems, 2005

Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.

Olgica Milenkovic, Kevin J. Compton

Algorithmica, 2005

Side Channel Analysis, Fault Injection and Applications - A Computationally Feasible SPA Attack on AES via Optimized Search.

Joel VanLaven, Mark Brehob, Kevin J. Compton

Proceedings of the Security and Privacy in the Age of Ubiquitous Computing, IFIP TC11 20th International Conference on Information Security (SEC 2005), May 30, 2005

2004

Probabilistic Transforms for Combinatorial Urn Models.

Olgica Milenkovic, Kevin J. Compton

Comb. Probab. Comput., 2004

Execution of A Requirement Model in Software Development.

Wuwei Shen, Mohsen Guizani, Zijiang Yang, Kevin J. Compton, James Huggins

Proceedings of the ISCA 13th International Conference on Intelligent and Adaptive Systems and Software Engineering, 2004

2003

The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes.

Olgica Milenkovic, T. S. Coffey, Kevin J. Compton

IEEE Trans. Inf. Theory, 2003

A Method of Implementing UML Virtual Machines With Some Constraints Based on Abstract State Machines.

Wuwei Shen, Kevin J. Compton, James Huggins

Proceedings of the 10th Asia-Pacific Software Engineering Conference (APSEC 2003), 2003

2002

A Toolset for Supporting UML Static and Dynamic Model Checking.

Wuwei Shen, Kevin J. Compton, James Huggins

Proceedings of the 26th International Computer Software and Applications Conference (COMPSAC 2002), 2002

2001

A UML Validation Toolset Based on Abstract State Machines.

Wuwei Shen, Kevin J. Compton, James Huggins

Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), 2001

Characterizations of Regular Languages in Low Level Complexity Classes.

Kevin J. Compton, Howard Straubing

Proceedings of the Current Trends in Theoretical Computer Science, 2001

1999

0-1 laws for maps.

Edward A. Bender, Kevin J. Compton, L. Bruce Richmond

Random Struct. Algorithms, 1999

A van der Waerden Variant.

Kevin J. Compton

Electron. J. Comb., 1999

Proof Techniques for Cryptographic Protocols.

Kevin J. Compton, Scott D. Dexter

Proceedings of the Automata, 1999

1996

Logical Definability of Counting Functions.

Kevin J. Compton, Erich Grädel

J. Comput. Syst. Sci., 1996

1995

Expected Deadlock Time in a Multiprocessing System.

Kevin J. Compton, Chinya V. Ravishankar

J. ACM, 1995

1994

Stratified Least Fixpoint Logic.

Kevin J. Compton

Theor. Comput. Sci., 1994

1993

Lower Bounds for the Complexity of Theories.

Kevin J. Compton

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

A Deductive System for Existential Least Fixpoint Logic.

Kevin J. Compton

J. Log. Comput., 1993

The Model Theory of Concurrency.

Kevin J. Compton, Rosario Uceda-Sosa

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Regular Languages in NC¹.

David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien

J. Comput. Syst. Sci., 1992

Characterizations of regular languages in low level complexity classes.

Kevin J. Compton, Howard Straubing

Bull. EATCS, 1992

Queries Are Easier Than You Thought (Probably).

Serge Abiteboul, Kevin J. Compton, Victor Vianu

Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.

Thomas Behrendt, Kevin J. Compton, Erich Grädel

Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991

Lower Bounds for the Complexity of Theories.

Kevin J. Compton

Bull. EATCS, 1991

1990

The largest set partitioned by a subfamily of a cover.

Kevin J. Compton, Carlos H. Montenegro

J. Comb. Theory, Ser. A, 1990

An Algebra and a Logic for NC¹

Kevin J. Compton, Claude Laflamme

Inf. Comput., 1990

A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.

Kevin J. Compton, C. Ward Henson

Ann. Pure Appl. Log., 1990

1989

A logical approach to asymptotic combinatorics II: Monadic second-order properties.

Kevin J. Compton

J. Comb. Theory, Ser. A, 1989

1988

The Computational Complexity of Asymptotic Problems I: Partial Orders

Kevin J. Compton

Inf. Comput., August, 1988

1987

Some methods for computing component distribution probabilities in relational structures.

Kevin J. Compton

Discret. Math., 1987

Nonconvergence, undecidability, and intractability in asymptotic problems.

Kevin J. Compton, C. Ward Henson, Saharon Shelah

Ann. Pure Appl. Log., 1987

1985

Application of a Tauberian theorem to finite model theory.

Kevin J. Compton

Arch. Math. Log., 1985

1984

An Undecidable Problem in Finite Combinatorics.

Kevin J. Compton

J. Symb. Log., 1984

1983

Some Useful Preservation Theorems.

Kevin J. Compton

J. Symb. Log., 1983