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 Volume=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Buffer overflow management in QoS switches
Alexander Kesselman
,
Zvi Lotker
,
Yishay Mansour
,
Boaz Patt-Shamir
,
Baruch Schieber
,
Maxim Sviridenko
SIAM Journal on Computing
33
(3), 2004, pp. 563-583
On the Frame-Stewart conjecture about the towers of Hanoi
Xiao Chen
,
Jian Shen
SIAM Journal on Computing
33
(3), 2004, pp. 584-589
Incomplete directed perfect phylogeny
Itsik Pe'er
,
Tal Pupko
,
Ron Shamir
,
Roded Sharan
SIAM Journal on Computing
33
(3), 2004, pp. 590-607
(1 + \epsilon,\beta)
-spanner constructions for general graphs
Michael Elkin
,
David Peleg
SIAM Journal on Computing
33
(3), 2004, pp. 608-631
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum
,
Howard Karloff
,
Claire Kenyon
,
Nick Reingold
,
Mikkel Thorup
SIAM Journal on Computing
33
(3), 2004, pp. 632-646
Distances and finger search in random binary search trees
Luc Devroye
,
Ralph Neininger
SIAM Journal on Computing
33
(3), 2004, pp. 647-658
The effects of temporary sessions on network performance
Matthew Andrews
,
Lisa Zhang
SIAM Journal on Computing
33
(3), 2004, pp. 659-673
Complete axiomatizations for reasoning about knowledge and time
Joseph Y. Halpern
,
Ron van der Meyden
,
Moshe Y. Vardi
SIAM Journal on Computing
33
(3), 2004, pp. 674-703
Hardness of approximation for vertex-connectivity network design problems
Guy Kortsarz
,
Robert Krauthgamer
,
James R. Lee
SIAM Journal on Computing
33
(3), 2004, pp. 704-720
The Glauber dynamics on colorings of a graph with high girth and maximum degree
Michael Molloy
SIAM Journal on Computing
33
(3), 2004, pp. 721-737
Quantum computation and lattice problems
Oded Regev
SIAM Journal on Computing
33
(3), 2004, pp. 738-760
Compaction, retraction, and constraint satisfaction
Narayan Vikas
SIAM Journal on Computing
33
(4), 2004, pp. 761-782
Strict polynomial-time in simulation and extraction
Boaz Barak
,
Yehuda Lindell
SIAM Journal on Computing
33
(4), 2004, pp. 783-818
The complexity of three-way statistical tables
Jesus de Loera
,
Shmuel Onn
SIAM Journal on Computing
33
(4), 2004, pp. 819-836
On multidimensional packing problems
Chandra Chekuri
,
Sanjeev Khanna
SIAM Journal on Computing
33
(4), 2004, pp. 837-851
Counting complexity of solvable black-box group problems
N.V. Vinodchandran
SIAM Journal on Computing
33
(4), 2004, pp. 852-869
Time of deterministic broadcasting in radio networks with local knowledge
Dariusz R. Kowalski
,
Andrzej Pelc
SIAM Journal on Computing
33
(4), 2004, pp. 870-891
The parameterized complexity of counting problems
Jörg Flum
,
Martin Grohe
SIAM Journal on Computing
33
(4), 2004, pp. 892-922
On worst-case Robin Hood hashing
Luc Devroye
,
Pat Morin
,
Alfredo Viola
SIAM Journal on Computing
33
(4), 2004, pp. 923-936
Online routing in triangulations
Prosenjit Bose
,
Pat Morin
SIAM Journal on Computing
33
(4), 2004, pp. 937-951
Distributional results for costs of partial match queries in asymmetric
k
-dimensional tries
Werner Schachinger
SIAM Journal on Computing
33
(4), 2004, pp. 952-983
On proving circuit lower bounds against the polynomial-time hierarchy
Jin-Yi Cai
,
Osamu Watanabe
SIAM Journal on Computing
33
(4), 2004, pp. 984-1009
Efficient algorithms for optimal stream merging for media-on-demand
Amotz Bar-Noy
,
Richard E. Ladner
SIAM Journal on Computing
33
(5), 2004, pp. 1011-1034
Better online algorithms for scheduling with machine cost
György Dósa
,
Yong He
SIAM Journal on Computing
33
(5), 2004, pp. 1035-1051
Solving equations in the relational algebra
Joachim Biskup
,
Jan Paredaens
,
Thomas Schwentick
,
Jan van den Bussche
SIAM Journal on Computing
33
(5), 2004, pp. 1052-1066
Seiten
<
1
2
3
>