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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Amortized analysis of algorithms for set union with backtracking
Jeffrey Westbrook
,
Robert E. Tarjan
SIAM Journal on Computing
18
(1), 1989, February, pp. 1-11
The bit complexity of randomized leader election on a ring
Karl Abrahamson
,
Andrew Adler
,
Rachel Gelbart
,
Lisa Higham
,
David Kirkpatrick
SIAM Journal on Computing
18
(1), 1989, February, pp. 12-29
A fast parametric maximum flow algorithm and applications
Giorgio Gallo
,
Michael D. Grigoriadis
,
Robert E. Tarjan
SIAM Journal on Computing
18
(1), 1989, February, pp. 30-55
Lower bounds for accessing binary search trees with rotations
Robert Wilber
SIAM Journal on Computing
18
(1), 1989, February, pp. 56-67
An incremental linear-time algorithm for recognizing interval graphs
Norbert Korte
,
Rolf H. Möhring
SIAM Journal on Computing
18
(1), 1989, February, pp. 68-81
Minimum delay codes
Lawrence L. Larmore
SIAM Journal on Computing
18
(1), 1989, February, pp. 82-94
The Boolean hierarchy II: Applications
Jin-Yi Cai
,
Thomas Gundermann
,
Juris Hartmanis
,
Lane A. Hemachandra
,
Vivian Sewelson
,
Klaus Wagner
,
Gerd Wechsung
SIAM Journal on Computing
18
(1), 1989, February, pp. 95-111
Algorithms and data structures for an expanded family of matroid intersection problems
Greg N. Frederickson
,
Mandayam A. Srinivas
SIAM Journal on Computing
18
(1), 1989, February, pp. 112-138
Optimal bin packing with items of random sizes II
Wansoo T. Rhee
,
Michel Talagrand
SIAM Journal on Computing
18
(1), 1989, February, pp. 139-151
Minimal threshold separators and memory requirements for synchronization
Edward T. Ordman
SIAM Journal on Computing
18
(1), 1989, February, pp. 152-165
Algorithms for packing squares: A probabilistic analysis
E.G., Jr. Coffman
,
J.C. Lagarias
SIAM Journal on Computing
18
(1), 1989, February, pp. 166-185
The knowledge complexity of interactive proof systems
Shafi Goldwasser
,
Silvio Micali
,
Charles Rackoff
SIAM Journal on Computing
18
(1), 1989, February, pp. 186-208
A lower bound on the complexity of division in finite extension fields and inversion in quadratic alternative algebras
Thomas Lickteig
SIAM Journal on Computing
18
(2), 1989, April, pp. 209-215
Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines
Gianfranco Bilardi
,
Alexandru Nicolau
SIAM Journal on Computing
18
(2), 1989, April, pp. 216-228
The token distribution problem
David Peleg
,
Eli Upfal
SIAM Journal on Computing
18
(2), 1989, April, pp. 229-243
Scheduling precedence graphs in systems with interprocessor communication times
Jing-Jang Hwang
,
Yuan-Chieh Chow
,
Frank D. Anger
,
Chung-Yee Lee
SIAM Journal on Computing
18
(2), 1989, April, pp. 244-257
Finding an approximate maximum
N. Alon
,
Y. Azar
SIAM Journal on Computing
18
(2), 1989, April, pp. 258-267
Bounds on universal sequences
Amotz Bar-Noy
,
Allan Borodin
,
Mauricio Karchmer
,
Nathan Linial
,
Michael Werman
SIAM Journal on Computing
18
(2), 1989, April, pp. 268-277
Worst-case growth rates of some classical problems of combinatorial optimization
J. Michael Steele
,
Timothy Law Snyder
SIAM Journal on Computing
18
(2), 1989, April, pp. 278-287
Optimal parallel 5-colouring of planar graphs
Torben Hagerup
,
Marek Chrobak
,
Krzysztof Diks
SIAM Journal on Computing
18
(2), 1989, April, pp. 288-300
Nonblocking multirate networks
Riccardo Melen
,
Jonathan S. Turner
SIAM Journal on Computing
18
(2), 1989, April, pp. 301-313
Minimizing schedule length subject to minimum flow time
Joseph Y.-T. Leung
,
Gilbert H. Young
SIAM Journal on Computing
18
(2), 1989, April, pp. 314-326
Fast parallel algorithms for chordal graphs
Joseph Naor
,
Moni Naor
,
Alejandro A. Schäffer
SIAM Journal on Computing
18
(2), 1989, April, pp. 327-349
On the worst-case arithmetic complexity of approximating zeros of systems of polynomials
James Renegar
SIAM Journal on Computing
18
(2), 1989, April, pp. 350-370
Partitioning space for range queries
F. Frances Yao
,
David P. Dobkin
,
Herbert Edelsbrunner
,
Michael S. Paterson
SIAM Journal on Computing
18
(2), 1989, April, pp. 371-384
Seiten 1
2
3
4
>