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: Journal=SIAM J. Comput. AND Volume=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Incremental string comparison
Gad M. Landau
,
Eugene W. Myers
,
Jeanette P. Schmidt
SIAM Journal on Computing
27
(2), 1998, pp. 557-582
Localizing a robot with minimum travel
Gregory Dudek
,
Kathleen Romanik
,
Sue Whitesides
SIAM Journal on Computing
27
(2), 1998, pp. 583-604
Listing all minimal separators of a graph
T. Kloks
,
D. Kratsch
SIAM Journal on Computing
27
(3), 1998, pp. 605-613
Efficient self-embedding of butterfly networks with random faults
Hisao Tamaki
SIAM Journal on Computing
27
(3), 1998, pp. 614-636
Splittings, robustness, and structure of complete sets
Harry Buhrman
,
Albrecht Hoene
,
Leen Torenvliet
SIAM Journal on Computing
27
(3), 1998, pp. 637-653
Constructing levels in arrangements and higher order Voronoi diagrams
Pankaj K. Agarwal
,
Mark de Berg
,
Jiȓí Matous̑ek
,
Otfried Schwarzkopf
SIAM Journal on Computing
27
(3), 1998, pp. 654-667
A constant time optimal parallel algorithm for two-dimensional pattern matching
Maxime Crochemore
,
Leszek Ga̧sieniec
,
Ramesh Hariharan
,
S. Muthukrishnan
,
Wojciech Rytter
SIAM Journal on Computing
27
(3), 1998, pp. 668-681
Improved randomized on-line algorithms for the list update problem
Susanne Albers
SIAM Journal on Computing
27
(3), 1998, pp. 682-693
Computing the additive complexity of algebraic circuits with root extracting
Dima Grigoriev
,
Marek Karpinski
SIAM Journal on Computing
27
(3), 1998, pp. 694-701
An
\Omega(D\log (ND))
lower bound for broadcast in radio networks
Eyal Kushilevitz
,
Yishay Mansour
SIAM Journal on Computing
27
(3), 1998, pp. 702-712
Optimal on-line search and sublinear time update in string matching
Paolo Ferragina
,
Roberto Grossi
SIAM Journal on Computing
27
(3), 1998, pp. 713-736
On the power of finite automata with both nondeterministic and probabilistic states
Anne Condon
,
Lisa Hellerstein
,
Samuel Pottle
,
Avi Wigderson
SIAM Journal on Computing
27
(3), 1998, pp. 739-762
A parallel repetition theorem
Ran Raz
SIAM Journal on Computing
27
(3), 1998, pp. 763-803
Free bits, PCPs, and nonapproximability - Towards tight results
Mihir Bellare
,
Oded Goldreich
,
Madhu Sudan
SIAM Journal on Computing
27
(3), 1998, pp. 804-915
Fast gossiping by short messages
Jean-Claude Bermond
,
Luisa Gargano
,
Adele A. Rescigno
,
Ugo Vaccaro
SIAM Journal on Computing
27
(4), 1998, pp. 917-941
Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
Reuven Bar-Yehuda
,
Dan Geiger
,
Joseph (Seffi) Naor
,
Ron M. Roth
SIAM Journal on Computing
27
(4), 1998, pp. 942-959
Planar integer linear programming is
NC
equivalent to Euclidean GCD
D.F. Shallcross
,
V.Y. Pan
,
Y. Lin-Kriz
SIAM Journal on Computing
27
(4), 1998, pp. 960-971
All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings
Jeanette P. Schmidt
SIAM Journal on Computing
27
(4), 1998, pp. 972-992
Bounding the power of preemption in randomized scheduling
Ran Canetti
,
Sandy Irani
SIAM Journal on Computing
27
(4), 1998, pp. 993-1015
Surface approximation and geometric partitions
Pankaj K. Agarwal
,
Subhash Suri
SIAM Journal on Computing
27
(4), 1998, pp. 1016-1035
Randomized data structures for the dynamic closest-pair problem
Mordecai Golin
,
Rajeev Raman
,
Christian Schwarz
,
Michiel Smid
SIAM Journal on Computing
27
(4), 1998, pp. 1036-1072
Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata
Hing Leung
SIAM Journal on Computing
27
(4), 1998, pp. 1073-1082
An
\Omega(\sqrt{\log\log n})
lower bound for routing in optical networks
Leslie Ann Goldberg
,
Mark Jerrum
,
Philip D. MacKenzie
SIAM Journal on Computing
27
(4), 1998, pp. 1083-1098
Computing matrix eigenvalues and polynomial zeros where the output is real
Dario Bini
,
Victor Y. Pan
SIAM Journal on Computing
27
(4), 1998, pp. 1099-1115
Computational complexity and knowledge complexity
Oded Goldreich
,
Rafail Ostrovsky
,
Erez Petrank
SIAM Journal on Computing
27
(4), 1998, pp. 1116-1141
Seiten
<
1
2
3
4
>