Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2006 | |
---|---|---|

33 | EE | 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 | ||

32 | 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 | |

31 | EE | 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) |

2004 | ||

30 | Wuwei Shen, Mohsen Guizani, Zijiang Yang, Kevin J. Compton, James Huggins: Execution of A Requirement Model in Software Development. IASSE 2004: 203-208 | |

29 | EE | Olgica Milenkovic, Kevin J. Compton: Probabilistic Transforms for Combinatorial Urn Models. Combinatorics, Probability & Computing 13(4-5): 645-675 (2004) |

2003 | ||

28 | EE | 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- |

27 | 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) | |

2002 | ||

26 | EE | Wuwei Shen, Kevin J. Compton, James Huggins: A Toolset for Supporting UML Static and Dynamic Model Checking. COMPSAC 2002: 147-152 |

2001 | ||

25 | EE | Wuwei Shen, Kevin J. Compton, James Huggins: A UML Validation Toolset Based on Abstract State Machines. ASE 2001: 315-318 |

24 | Kevin J. Compton, Howard Straubing: Characterizations of Regular Languages in Low Level Complexity Classes. Current Trends in Theoretical Computer Science 2001: 235-246 | |

1999 | ||

23 | EE | Kevin J. Compton, Scott Dexter: Proof Techniques for Cryptographic Protocols. ICALP 1999: 25-39 |

22 | EE | Kevin J. Compton: A van der Waerden Variant. Electr. J. Comb. 6: (1999) |

21 | Edward A. Bender, Kevin J. Compton, L. Bruce Richmond: 0-1 laws for maps. Random Struct. Algorithms 14(3): 215-237 (1999) | |

1996 | ||

20 | Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53(2): 283-297 (1996) | |

1995 | ||

19 | EE | Kevin J. Compton, Chinya V. Ravishankar: Expected Deadlock Time in a Multiprocessing System. J. ACM 42(3): 562-583 (1995) |

1994 | ||

18 | Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. Structure in Complexity Theory Conference 1994: 255-266 | |

17 | Kevin J. Compton: Stratified Least Fixpoint Logic. Theor. Comput. Sci. 131(1): 95-120 (1994) | |

1993 | ||

16 | EE | Kevin J. Compton, Rosario Uceda-Sosa: The Model Theory of Concurrency. CSL 1993: 78-90 |

15 | Kevin J. Compton: A Deductive System for Existential Least Fixpoint Logic. J. Log. Comput. 3(2): 197-213 (1993) | |

1992 | ||

14 | EE | Thomas Behrendt, Kevin J. Compton, Erich Grädel: Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. CSL 1992: 43-60 |

13 | EE | Serge Abiteboul, Kevin J. Compton, Victor Vianu: Queries Are Easier Than You Thought (Probably). PODS 1992: 23-32 |

12 | Kevin J. Compton, Howard Straubing: Characterizations of regular languages in low level complexity classes. Bulletin of the EATCS 48: 134-142 (1992) | |

11 | 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) | |

1991 | ||

10 | Kevin J. Compton: Lower Bounds for the Complexity of Theories. Bulletin of the EATCS 43: 113-123 (1991) | |

1990 | ||

9 | 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) | |

8 | Kevin J. Compton, Claude Laflamme: An Algebra and a Logic for NC¹ Inf. Comput. 87(1/2): 240-262 (1990) | |

7 | EE | 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 | ||

6 | EE | 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 | ||

5 | Kevin J. Compton, Claude Laflamme: An Algebra and a Logic for NC¹ LICS 1988: 12-21 | |

4 | Kevin J. Compton: The Computational Complexity of Asymptotic Problems I: Partial Orders Inf. Comput. 78(2): 108-123 (1988) | |

1987 | ||

3 | EE | Kevin J. Compton: Some methods for computing component distribution probabilities in relational structures. Discrete Mathematics 66(1-2): 59-77 (1987) |

1984 | ||

2 | Kevin J. Compton: An Undecidable Problem in Finite Combinatorics. J. Symb. Log. 49(3): 842-850 (1984) | |

1983 | ||

1 | Kevin J. Compton: Some Useful Preservation Theorems. J. Symb. Log. 48(2): 427-440 (1983) |

1 | Serge Abiteboul | [13] |

2 | David A. Mix Barrington | [11] |

3 | Thomas Behrendt | [14] |

4 | Edward A. Bender | [21] |

5 | Mark Brehob | [32] |

6 | T. S. Coffey | [27] |

7 | Scott Dexter | [23] |

8 | Erich Grädel | [14] [18] [20] |

9 | Mohsen Guizani | [30] |

10 | C. Ward Henson | [9] |

11 | James Huggins | [25] [26] [28] [30] |

12 | Claude Laflamme | [5] [8] |

13 | Olgica Milenkovic | [27] [29] [31] |

14 | Carlos H. Montenegro | [7] |

15 | Chinya V. Ravishankar | [19] |

16 | L. Bruce Richmond | [21] |

17 | William C. Rounds | [33] |

18 | Wuwei Shen | [25] [26] [28] [30] |

19 | Hosung Song | [33] |

20 | Howard Straubing | [11] [12] [24] |

21 | Denis Thérien | [11] |

22 | Rosario Uceda-Sosa | [16] |

23 | Joel VanLaven | [32] |

24 | Victor Vianu | [13] |

25 | Zijiang Yang | [30] |