Kevin J. Compton

39 papers A* 4A 1B 3C 1Misc 1Journal 24Unranked 3
YearRankTypeTitle / Venue / Authors
2016 J jnl
A Simple Power Analysis Attack on the Twofish Key Schedule.
CoRR
Jose Javier Gonzalez Ortiz, Kevin J. Compton
2013 A conf
Detecting Traditional Packers, Decisively.
RAID
Denis Bueno, Kevin J. Compton, Karem A. Sakallah, Michael D. Bailey
2009 J jnl
A Simple Power Analysis Attack on the Serpent Key Schedule.
IACR Cryptol. ePrint Arch.
Kevin J. Compton, Brian Timm, Joel VanLaven
2005 J jnl
Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.
Algorithmica
Olgica Milenkovic, Kevin J. Compton
2005 — conf
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.
AVoCS
Hosung Song, Kevin J. Compton, William C. Rounds
2005 Misc conf
Side Channel Analysis, Fault Injection and Applications - A Computationally Feasible SPA Attack on AES via Optimized Search.
SEC
Joel VanLaven, Mark Brehob, Kevin J. Compton
2004 — conf
Execution of A Requirement Model in Software Development.
IASSE
Wuwei Shen, Mohsen Guizani, Zijiang Yang, Kevin J. Compton, James Huggins
2004 J jnl
Probabilistic Transforms for Combinatorial Urn Models.
Comb. Probab. Comput.
Olgica Milenkovic, Kevin J. Compton
2003 C conf
A Method of Implementing UML Virtual Machines With Some Constraints Based on Abstract State Machines.
APSEC
Wuwei Shen, Kevin J. Compton, James Huggins
2003 J jnl
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes.
IEEE Trans. Inf. Theory
Olgica Milenkovic, T. S. Coffey, Kevin J. Compton
2002 B conf
A Toolset for Supporting UML Static and Dynamic Model Checking.
COMPSAC
Wuwei Shen, Kevin J. Compton, James Huggins
2001 A* conf
A UML Validation Toolset Based on Abstract State Machines.
ASE
Wuwei Shen, Kevin J. Compton, James Huggins
2001 — ch.
Characterizations of Regular Languages in Low Level Complexity Classes.
Current Trends in Theoretical Computer Science
Kevin J. Compton, Howard Straubing
1999 J jnl
0-1 laws for maps.
Random Struct. Algorithms
Edward A. Bender, Kevin J. Compton, L. Bruce Richmond
1999 J jnl
A van der Waerden Variant.
Electron. J. Comb.
Kevin J. Compton
1999 A* conf
Proof Techniques for Cryptographic Protocols.
ICALP
Kevin J. Compton, Scott D. Dexter
1996 J jnl
Logical Definability of Counting Functions.
J. Comput. Syst. Sci.
Kevin J. Compton, Erich Grädel
1995 J jnl
Expected Deadlock Time in a Multiprocessing System.
J. ACM
Kevin J. Compton, Chinya V. Ravishankar
1994 — conf
Logical Definability of Counting Functions.
SCT
Kevin J. Compton, Erich Grädel
1994 J jnl
Stratified Least Fixpoint Logic.
Theor. Comput. Sci.
Kevin J. Compton
1993 J jnl
A Deductive System for Existential Least Fixpoint Logic.
J. Log. Comput.
Kevin J. Compton
1993 — ch.
Lower Bounds for the Complexity of Theories.
Current Trends in Theoretical Computer Science
Kevin J. Compton
1993 B conf
The Model Theory of Concurrency.
CSL
Kevin J. Compton, Rosario Uceda-Sosa
1992 J jnl
Characterizations of regular languages in low level complexity classes.
Bull. EATCS
Kevin J. Compton, Howard Straubing
1992 B conf
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
CSL
Thomas Behrendt, Kevin J. Compton, Erich Grädel
1992 A* conf
Queries Are Easier Than You Thought (Probably).
PODS
Serge Abiteboul, Kevin J. Compton, Victor Vianu
1992 J jnl
Regular Languages in NC¹.
J. Comput. Syst. Sci.
David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
1991 J jnl
Lower Bounds for the Complexity of Theories.
Bull. EATCS
Kevin J. Compton
1990 J jnl
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.
Ann. Pure Appl. Log.
Kevin J. Compton, C. Ward Henson
1990 J jnl
An Algebra and a Logic for NC¹
Inf. Comput.
Kevin J. Compton, Claude Laflamme
1990 J jnl
The largest set partitioned by a subfamily of a cover.
J. Comb. Theory A
Kevin J. Compton, Carlos H. Montenegro
1989 J jnl
A logical approach to asymptotic combinatorics II: Monadic second-order properties.
J. Comb. Theory A
Kevin J. Compton
1988 A* conf
An Algebra and a Logic for NC¹
LICS
Kevin J. Compton, Claude Laflamme
1988 J jnl
The Computational Complexity of Asymptotic Problems I: Partial Orders
Inf. Comput.
Kevin J. Compton
1987 J jnl
Nonconvergence, undecidability, and intractability in asymptotic problems.
Ann. Pure Appl. Log.
Kevin J. Compton, C. Ward Henson, Saharon Shelah
1987 J jnl
Some methods for computing component distribution probabilities in relational structures.
Discret. Math.
Kevin J. Compton
1985 J jnl
Application of a Tauberian theorem to finite model theory.
Arch. Math. Log.
Kevin J. Compton
1984 J jnl
An Undecidable Problem in Finite Combinatorics.
J. Symb. Log.
Kevin J. Compton
1983 J jnl
Some Useful Preservation Theorems.
J. Symb. Log.
Kevin J. Compton