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="Gasarch, William"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Limits on the computational power of random strings
Eric Allender
,
Luke Friedman
,
William Gasarch
Information and Computation
222
, 2013, pp. 80-92
Limits on the computational power of random strings
Eric Allender
,
Luke Friedman
,
William Gasarch
Lecture Notes in Computer Science
6755
, 2011, pp. 293-304
The complexity of finding SUBSEQ(A)
Stephen Fenner
,
William Gasarch
,
Brian Postow
Theory of Computing Systems
45
(3), 2009, pp. 577-612
Finding large 3-free sets I: The small
n
case
William Gasarch
,
James Glenn
,
Clyde P. Kruskal
Journal of Computer and System Sciences
74
(4), 2008, pp. 628-655
Inferring answers to queries
William I. Gasarch
,
Andrew C.Y. Lee
Journal of Computer and System Sciences
74
(4), 2008, pp. 490-512
Lower bounds on the deterministic and quantum communication complexities of Hamming-distance problems
Andris Ambainis
,
William Gasarch
,
Aravind Srinivasan
,
Andrey Utis
Lecture Notes in Computer Science
4288
, 2006, pp. 628-637
The multiparty communication complexity of exact-
T
: Improved bounds and new problems
Richard Beigel
,
William Gasarch
,
James Glenn
Lecture Notes in Computer Science
4162
, 2006, pp. 146-156
Some connections between bounded query classes and non-uniform complexity
Amihood Amir
,
Richard Beigel
,
William Gasarch
Information and Computation
186
(1), 2003, pp. 104-139
Constant time parallel sorting: An empirical view
William Gasarch
,
Evan Golub
,
Clyde Kruskal
Journal of Computer and System Sciences
67
(1), 2003, pp. 63-91
When does a random Robin Hood win?
William Gasarch
,
Evan Golub
,
Aravind Srinivasan
Theoretical Computer Science
304
(1-3), 2003, pp. 477-484
The communication complexity of enumeration, elimination, and selection
Andris Ambainis
,
Harry Buhrman
,
William Gasarch
,
Bala Kalyanasundaram
,
Leen Torenvliet
Journal of Computer and System Sciences
63
(2), 2001, pp. 148-185
The communication complexity of enumeration, elimination, and selection
Andris Ambainis
,
Harry Buhrman
,
William Gasarch
,
Bala Kalyanasundaram
,
Leen Torenvliet
Proceedings of the 15th Annual IEEE Conference on Computational Complexity (Florence, Italy, July 4-7, 2000)
, 2000, pp. 44-53
On the relative sizes of learnable sets
Lance Fortnow
,
Rūsiņs̑ Freivalds
,
William I. Gasarch
,
Martin Kummer
,
Stuart A. Kurtz
,
Carl H. Smith
,
Frank Stephan
Theoretical Computer Science
197
(1-2), 1998, pp. 139-156
On bounded queries and approximation
Richard Chang
,
William I. Gasarch
,
Carsten Lund
SIAM Journal on Computing
26
(1), 1997, pp. 188-209
Binary search and recursive graph problems
William I. Gasarch
,
Katia S. Guimarães
Theoretical Computer Science
181
(1), 1997, pp. 119-139
Frequency computation and bounded queries
Richard Beigel
,
William Gasarch
,
Efim Kinber
Theoretical Computer Science
163
(1-2), 1996, pp. 177-192
On the query complexity of sets
Richard Beigel
,
William Gasarch
,
Martin Kummer
,
Georgia Martin
,
Timothy McNicholl
,
Frank Stephan
Lecture Notes in Computer Science
1113
, 1996, pp. 206-217
Finding the
i
th largest of
n
for small
i
,
n
William Gasarch
,
Wayne Kelly
,
William Pugh
ACM SIGACT News
27
(2), 1996, pp. 88-96
Frequency computation and bounded queries
Richard Beigel
,
William Gasarch
,
Efim Kinber
Proceedings of the 10th Annual Conference on Structure in Complexity Theory, CSCT'95 (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 125-132
Frequency computation and boundes queries
Richard Beigel
,
William Gasarch
,
Efim Kinber
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 125-132
On finding the number of graph automorphisms
Richard Chang
,
William Gasarch
,
Jacobo Torán
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 288-298
Measure, category and learning theory
Lance Fortnow
,
Rūsiņs̑ Freivalds
,
William I. Gasarch
,
Martin Kummer
,
Stuart A. Kurtz
,
Carl Smith
,
Frank Stephan
Lecture Notes in Computer Science
944
, 1995, pp. 558-569
Unbounded search and recursive graph problems
William I. Gasarch
,
Katia S. Guimarães
Lecture Notes in Computer Science
911
, 1995, pp. 323-331
Terse, superterse, and verbose sets
Richard Beigel
,
William I. Gasarch
,
John Gill
,
James C. Owings
Information and Computation
103
(1), 1993, March, pp. 68-85
On bounded queries and approximation
Richard Chang
,
William I. Gasarch
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 547-556
Seiten 1
2
>