default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin J. Compton
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i2]Jose Javier Gonzalez Ortiz, Kevin J. Compton:
A Simple Power Analysis Attack on the Twofish Key Schedule. CoRR abs/1611.07109 (2016)- 2013
- [c13]Denis Bueno, Kevin J. Compton, Karem A. Sakallah, Michael D. Bailey:
Detecting Traditional Packers, Decisively. RAID 2013: 184-203
2000 – 2009
- 2009
- [i1]Kevin J. Compton, Brian Timm, Joel VanLaven:
A Simple Power Analysis Attack on the Serpent Key Schedule. IACR Cryptol. ePrint Arch. 2009: 473 (2009) - 2005
- [j22]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) - [c12]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 - [c11]Hosung Song, Kevin J. Compton, William C. Rounds:
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN. AVoCS 2005: 167-183 - 2004
- [j21]Olgica Milenkovic, Kevin J. Compton:
Probabilistic Transforms for Combinatorial Urn Models. Comb. Probab. Comput. 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
- [j20]Olgica Milenkovic, T. S. Coffey, Kevin J. Compton:
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. IEEE Trans. Inf. 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
- [c7]Wuwei Shen, Kevin J. Compton, James Huggins:
A UML Validation Toolset Based on Abstract State Machines. ASE 2001: 315-318 - [p2]Kevin J. Compton, Howard Straubing:
Characterizations of Regular Languages in Low Level Complexity Classes. Current Trends in Theoretical Computer Science 2001: 235-246
1990 – 1999
- 1999
- [j19]Kevin J. Compton:
A van der Waerden Variant. Electron. J. Comb. 6 (1999) - [j18]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 D. Dexter
:
Proof Techniques for Cryptographic Protocols. ICALP 1999: 25-39 - 1996
- [j17]Kevin J. Compton, Erich Grädel:
Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53(2): 283-297 (1996) - 1995
- [j16]Kevin J. Compton, Chinya V. Ravishankar:
Expected Deadlock Time in a Multiprocessing System. J. ACM 42(3): 562-583 (1995) - 1994
- [j15]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. SCT 1994: 255-266 - 1993
- [j14]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 - [p1]Kevin J. Compton:
Lower Bounds for the Complexity of Theories. Current Trends in Theoretical Computer Science 1993: 318-331 - 1992
- [j13]Kevin J. Compton, Howard Straubing:
Characterizations of regular languages in low level complexity classes. Bull. EATCS 48: 134-142 (1992) - [j12]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
- [j11]Kevin J. Compton:
Lower Bounds for the Complexity of Theories. Bull. EATCS 43: 113-123 (1991) - 1990
- [j10]Kevin J. Compton, C. Ward Henson:
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Ann. Pure Appl. Log. 48(1): 1-79 (1990) - [j9]Kevin J. Compton, Claude Laflamme:
An Algebra and a Logic for NC¹. Inf. Comput. 87(1/2): 240-262 (1990) - [j8]Kevin J. Compton, Carlos H. Montenegro:
The largest set partitioned by a subfamily of a cover. J. Comb. Theory A 54(2): 296-303 (1990)
1980 – 1989
- 1989
- [j7]Kevin J. Compton:
A logical approach to asymptotic combinatorics II: Monadic second-order properties. J. Comb. Theory A 50(1): 110-131 (1989) - 1988
- [j6]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
- [j5]Kevin J. Compton, C. Ward Henson, Saharon Shelah:
Nonconvergence, undecidability, and intractability in asymptotic problems. Ann. Pure Appl. Log. 36: 207-224 (1987) - [j4]Kevin J. Compton:
Some methods for computing component distribution probabilities in relational structures. Discret. Math. 66(1-2): 59-77 (1987) - 1985
- [j3]Kevin J. Compton:
Application of a Tauberian theorem to finite model theory. Arch. Math. Log. 25(1): 91-98 (1985) - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
