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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
The complexity of planar counting problems
Harry B. III Hunt
,
Madhav V. Marathe
,
Venkatesh Radhakrishnan
,
Richard E. Stearns
SIAM Journal on Computing
27
(4), 1998, pp. 1142-1167
Guaranteeing fair service to persistent dependent tasks
Amotz Bar-Noy
,
Alain Mayer
,
Baruch Schieber
,
Madhu Sudan
SIAM Journal on Computing
27
(4), 1998, pp. 1168-1189
Time-space lower bounds for directed
st
-connectivity on graph automata models
Greg Barnes
,
Jeff A. Edmonds
SIAM Journal on Computing
27
(4), 1998, pp. 1190-1202
A Chernoff bound for random walks on expander graphs
David Gillman
SIAM Journal on Computing
27
(4), 1998, pp. 1203-1220
Processor-ring communication: A tight asymptotic bound on packet waiting times
E.G., Jr. Coffman
,
Nabil Kahale
,
F.T. Leighton
SIAM Journal on Computing
27
(5), 1998, pp. 1221-1236
Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems
Madhav V. Marathe
,
Harry B. Hunt III
,
Richard E. Stearns
,
Venkatesh Radhakrishnan
SIAM Journal on Computing
27
(5), 1998, pp. 1237-1261
Approximately counting Hamilton paths and cycles in dense graphs
Martin Dyer
,
Alan Frieze
,
Mark Jerrum
SIAM Journal on Computing
27
(5), 1998, pp. 1262-1272
A sublinear space, polynomial time algorithm for directed
s-t
connectivity
Greg Barnes
,
Jonathan F. Buss
,
Walter L. Ruzzo
,
Baruch Schieber
SIAM Journal on Computing
27
(5), 1998, pp. 1273-1282
Monotone circuits for connectivity have depth
(\log n)^{2-o(1)}
Mikael Goldmann
,
Johan HÃ¥stad
SIAM Journal on Computing
27
(5), 1998, pp. 1283-1294
Complexity analysis of a parallel lattice basis reduction algorithm
C. Heckler
,
L. Thiele
SIAM Journal on Computing
27
(5), 1998, pp. 1295-1302
Seiten
<
1
2
3
4
5
>