Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Compton, Kevin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average case analysis of Gosper's algorithm for a class of urn model inputs
Olgica Milenkovic
,
Kevin J. Compton
Algorithmica
43
(3), 2005, pp. 211-244
Proof techniques for cryptographic protocols
Kevin J. Compton
,
Scott Dexter
Lecture Notes in Computer Science
1644
, 1999, pp. 25-39
Logical definability of counting functions
Kevin J. Compton
,
Erich Grädel
Journal of Computer and System Sciences
53
(2), 1996, pp. 283-297
Expected deadlock time in a multiprocessing system
Kevin J. Compton
,
Chinya Ravishankar
Journal of the ACM
42
(3), 1995, May, pp. 562-583
Logical definability of counting functions
Kevin J. Compton
,
Erich Grädel
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 255-266
Stratified least fixpoint logic
Kevin J. Compton
Theoretical Computer Science
131
(1), 1994, pp. 95-120
Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions
Thomas Behrendt
,
Kevin Compton
,
Erich Grädel
Technical Report (TR-93-002), 1993, January
Regular languages in
NC^1
David A. Mix Barrington
,
Kevin Compton
,
Howard Straubing
,
Denis Thérien
Journal of Computer and System Sciences
44
, 1992, pp. 478-499
An algebra and a logic for
NC^1
Kevin J. Compton
,
Claude Laflamme
Information and Computation
87
(1/2), 1990, July/August, pp. 241-263
The largest set partitioned by a subfamily of a cover
Kevin J. Compton
,
Carlos H. Montenegro
Journal of Combinatorial Theory Series A
54
, 1990, pp. 296-303
A logical approach to asymptotic combinatorics II: Monadic second-order properties
Kevin J. Compton
Journal of Combinatorial Theory Series A
50
, 1989, pp. 110-131
The computational complexity of asymptotic problems I: Partial Orders
Kevin J. Compton
Information and Computation
78
(2), 1988, pp. 108-123