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: Journal=SIAM J. Comput. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast construction of nets in low-dimensional metrics and their applications
Sariel Har-Peled
,
Manor Mendel
SIAM Journal on Computing
35
(5), 2006, pp. 1148-1184
Extracting randomness via repeated condensing
Omer Reingold
,
Ronen Shaltiel
,
Avi Wigderson
SIAM Journal on Computing
35
(5), 2006, pp. 1185-1209
Word problems and membership problems on compressed words
Markus Lohrey
SIAM Journal on Computing
35
(5), 2006, pp. 1210-1240
Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
Maurice Queyranne
,
Andreas S. Schulz
SIAM Journal on Computing
35
(5), 2006, pp. 1241-1253
Oblivious polynomial evaluation
Moni Naor
,
Benny Pinkas
SIAM Journal on Computing
35
(5), 2006, pp. 1254-1281
An algorithm for computing fundamental solutions
Klaus Weihrauch
,
Ning Zhong
SIAM Journal on Computing
35
(6), 2006, pp. 1283-1294
Compact labeling scheme for ancestor queries
Serge Abiteboul
,
Stephen Alstrup
,
Haim Kaplan
,
Tova Milo
,
Theis Rauhe
SIAM Journal on Computing
35
(6), 2006, pp. 1295-1309
Quantum query complexity of some graph problems
Christoph Dürr
,
Mark Heiligman
,
Peter Hyer
,
Mehdi Mhalla
SIAM Journal on Computing
35
(6), 2006, pp. 1310-1328
The approximability of three-valued MAX CSP
Peter Jonsson
,
Mikael Klasson
,
Andrei Krokhin
SIAM Journal on Computing
35
(6), 2006, pp. 1329-1349
Balanced allocations: The heavily loaded case
Petra Berenbrink
,
Artur Czumaj
,
Angelika Steger
,
Berthold Vöcking
SIAM Journal on Computing
35
(6), 2006, pp. 1350-1385
Linearization and completeness results for terminating transitive closure queries on spatial databases
Floris Geerts
,
Bart Kuijpers
,
Jan Van den Bussche
SIAM Journal on Computing
35
(6), 2006, pp. 1386-1439
Partial match queries in random
k-d
trees
Hua-Huai Chern
,
Hsien-Kuei Hwang
SIAM Journal on Computing
35
(6), 2006, pp. 1440-1466
Power from random strings
Eric Allender
,
Harry Buhrman
,
Michal Koucký
,
Dieter van Melkebeek
,
Detlef Ronneburger
SIAM Journal on Computing
35
(6), 2006, pp. 1467-1493
Fully dynamic orthogonal range reporting on RAM
Christian Worm Mortensen
SIAM Journal on Computing
35
(6), 2006, pp. 1494-1525
Seiten
<
1
2
3
4