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: Journal=SIAM J. Comput. AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the maximum scatter Traveling Salesperson Problem
Esther M. Arkin
,
Yi-Jen Chiang
,
Joseph S.B. Mitchell
,
Steven S. Skiena
,
Tae-Cheon Yang
SIAM Journal on Computing
29
(2), 1999, pp. 515-544
The parametrized complexity of some fundamental problems in coding theory
Rod G. Downey
,
Michael R. Fellows
,
Alexander Vardy
,
Geoff Whittle
SIAM Journal on Computing
29
(2), 1999, pp. 545-570
Two- and higher-dimensional pattern matching in optimal expected time
Juha Kärkkäinen
,
Esko Ukkonen
SIAM Journal on Computing
29
(2), 1999, pp. 571-589
Kolmogorov random graphs and the incompressibility method
Harry Buhrman
,
Ming Li
,
John Tromp
,
Paul Vitányi
SIAM Journal on Computing
29
(2), 1999, pp. 590-599
Self-stabilizing algorithms for finding centers and medians of trees
Steven C. Bruell
,
Sukumar Ghosh
,
Mehmet Hakan Karaata
,
Sriram V. Pemmaraju
SIAM Journal on Computing
29
(2), 1999, pp. 600-614
Automatic methods for hiding latency in parallel and distributed computation
Matthew Andrews
,
Tom Leighton
,
P. Takis Metaxas
,
Lisa Zhang
SIAM Journal on Computing
29
(2), 1999, pp. 615-647
Improved approximation guarantees for packing and covering integer programs
Aravind Srinivasan
SIAM Journal on Computing
29
(2), 1999, pp. 648-670
An efficient algorithm for generating necklaces with fixed density
Frank Ruskey
,
Joe Sawada
SIAM Journal on Computing
29
(2), 1999, pp. 671-684
Finding an even simple path in a directed planar graph
Zhivko Prodanov Nedev
SIAM Journal on Computing
29
(2), 1999, pp. 685-695
The angular-metric Traveling Salesman Problem
Alok Aggarwal
,
Don Coppersmith
,
Sanjeev Khanna
,
Rajeev Motwani
,
Baruch Schieber
SIAM Journal on Computing
29
(3), 1999-2000, pp. 697-711
On learning functions from noise-free and noisy samples via Occam's razor
B. Natarajan
SIAM Journal on Computing
29
(3), 1999-2000, pp. 712-727
Navigation in hypertext is easy only sometimes
Mark Levene
,
George Loizou
SIAM Journal on Computing
29
(3), 1999-2000, pp. 728-760
A polynomial-time approximation scheme for minimum routing cost spanning trees
Bang Ye Wu
,
Giuseppe Lancia
,
Vineet Bafna
,
Kun-Mao Chao
,
R. Ravi
,
Chuan Yi Tang
SIAM Journal on Computing
29
(3), 1999-2000, pp. 761-778
Complexity of deciding sense of direction
Paolo Boldi
,
Sebastiano Vigna
SIAM Journal on Computing
29
(3), 1999-2000, pp. 779-789
Rigorous time/space trade-offs for inverting functions
Amos Fiat
,
Moni Naor
SIAM Journal on Computing
29
(3), 1999-2000, pp. 790-803
Bubbles: Adaptive routing scheme for high-speed dynamic networks
Shlomi Dolev
,
Evangelos Kranakis
,
Danny Krizanc
,
David Peleg
SIAM Journal on Computing
29
(3), 1999-2000, pp. 804-833
Randomly sampling molecules
Leslie Ann Goldberg
,
Mark Jerrum
SIAM Journal on Computing
29
(3), 1999-2000, pp. 834-853
Computational sample complexity
Scott E. Decatur
,
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
29
(3), 1999-2000, pp. 854-879
A faster and simpler algorithm for sorting signed permutations by reversals
Haim Kaplan
,
Ron Shamir
,
Robert E. Tarjan
SIAM Journal on Computing
29
(3), 1999-2000, pp. 880-892
Compression of low entropy strings with Lempel-Ziv algorithms
S. Rao Kosaraju
,
Giovanni Manzini
SIAM Journal on Computing
29
(3), 1999-2000, pp. 893-911
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Pankaj K. Agarwal
,
Alon Efrat
,
Micha Sharir
SIAM Journal on Computing
29
(3), 1999-2000, pp. 912-953
A
2\frac{1}{2}
-approximation algorithm for shortest superstring
Z. Sweedyk
SIAM Journal on Computing
29
(3), 1999-2000, pp. 954-986
On the structure of logspace probabilistic complexity classes
Ioan I. Macarie
SIAM Journal on Computing
29
(3), 1999-2000, pp. 987-1007
Approximation algorithms for the orthogonal
Z
-oriented three-dimensional packing problem
F.K. Miyazawa
,
Y. Wakabayashi
SIAM Journal on Computing
29
(3), 1999-2000, pp. 1008-1029
Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree
Dan E. Willard
SIAM Journal on Computing
29
(3), 1999-2000, pp. 1030-1049
Seiten
<
1
2
3
4
>