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
[1]
Hilfe
Suche: Author="Steiger, William"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
Sambuddha Roy
,
William Steiger
Graphs and Combinatorics
23
(S1), 2007, pp. 331-341
Optimization in arrangements
Stefan Langerman
,
William Steiger
Lecture Notes in Computer Science
2607
, 2003, pp. 50-61
Space-time trade-offs for some ranking and searching queries
Adrian Dumitrescu
,
William Steiger
Information Processing Letters
79
(5), 2001, pp. 237-241
Some geometric lower bounds
Hank Chien
,
William Steiger
Lecture Notes in Computer Science
1004
, 1995, pp. 72-81
A pseudo-algorithmic separation of lines from pseudo-lines
William Steiger
,
Ileana Streinu
Information Processing Letters
53
, 1995, pp. 295-299
Ham-sandwich cuts in
R^d
Chi-Yuan Lo
,
Jiȓí Matous̑ek
,
William Steiger
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 539-545
Two infinite sets of primes with fast primality tests
János Pintz
,
William Steiger
,
Endre Szemerédi
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 504-509
The parallel complexity of element distinctness is
\Omega(\sqrt{\log n})
Prabhakar Ragde
,
William Steiger
,
Endre Szemerédi
,
Avi Wigderson
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 399-410