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
[2]
Hilfe
Suche: Author="Melkebeek, Dieter van"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Power from random strings
Eric Allender
,
Harry Buhrman
,
Michal Koucký
,
Dieter van Melkebeek
,
Detlef Ronneburger
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 669-678
The quantum black-box complexity of majority
Thomas P. Hayes
,
Samuel Kutin
,
Dieter van Melkebeek
Algorithmica
34
(4), 2002, pp. 480-501
Computational depth
Luis Antunes
,
Lance Fortnow
,
Dieter van Melkebeek
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 266-273
Optimal proof systems and sparse sets
Harry Buhrman
,
Steve Fenner
,
Lance Fortnow
,
Dieter van Melkebeek
Lecture Notes in Computer Science
1770
, 2000, pp. 407-418
Time-space tradeoffs for nondeterministic computation
Lance Fortnow
,
Dieter van Melkebeek
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 2-13
Time-space tradeoffs for nondeterministic computation
Lance Fortnow
,
Dieter van Melkebeek
Technical Report (2000-06), 2000
Time-space tradeoffs for nondeterministic computation
Lance Fortnow
,
Dieter van Melkebeek
Technical Report (TR00-028), 2000
Hard sets are hard to find
Harry Buhrman
,
Dieter van Melkebeek
Journal of Computer and System Sciences
59
(2), 1999, pp. 327-345
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
Adam R. Klivans
,
Dieter van Melkebeek
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 659-667
A generalization of resource-bounded measure, with an application
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
Lecture Notes in Computer Science
1373
, 1998, pp. 161-171