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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of resource-bounded measure, with application to the BPP vs. EXP problem
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
SIAM Journal on Computing
30
(2), 2000, pp. 576-601
Cavity matchings, label compressions, and unrooted evolutionary trees
Ming-Yang Kao
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Hing-Fung Ting
SIAM Journal on Computing
30
(2), 2000, pp. 602-624
Constructive, deterministic implementation of shared memory on meshes
Andrea Pietracaprina
,
Geppino Pucci
,
Jop F. Sibeyn
SIAM Journal on Computing
30
(2), 2000, pp. 625-648
How to make a square grid framework with cables rigid
Harold N. Gabow
,
Tibor Jordán
SIAM Journal on Computing
30
(2), 2000, pp. 649-680
On a conjecture by Coffman, Flatto, and Wright on stochastic machine minimization
Nah-Oak Song
,
Demosthenis Teneketzis
SIAM Journal on Computing
30
(2), 2000, pp. 681-687
All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust
Wai-Kau Lo
,
Vassos Hadzilacos
SIAM Journal on Computing
30
(3), 2000, pp. 689-728
From gene trees to species trees
Bin Ma
,
Ming Li
,
Louxin Zhang
SIAM Journal on Computing
30
(3), 2000, pp. 729-752
The general structure of edge-connectivity of a vertex subset in a graph and its incremental maintenance. Odd case
Yefim Dinitz
,
Alek Vainshtein
SIAM Journal on Computing
30
(3), 2000, pp. 753-808
Formal-language-constrained path problems
Chris Barrett
,
Riko Jacob
,
Madhav Marathe
SIAM Journal on Computing
30
(3), 2000, pp. 809-837
A fast general methodology for information-theoretically optimal encodings of graphs
Xin He
,
Ming-Yang Kao
,
Hsueh-I Lu
SIAM Journal on Computing
30
(3), 2000, pp. 838-846
Efficiently constructing the visibility graph of a simple polygon with obstacles
Sanjiv Kapoor
,
S.N. Maheshwari
SIAM Journal on Computing
30
(3), 2000, pp. 847-871
Optimal worst case formulas comparing cache memory associativity
Håkan Lennerstad
,
Lars Lundberg
SIAM Journal on Computing
30
(3), 2000, pp. 872-905
Markov paging
Anna R. Karlin
,
Steven J. Phillips
,
Prabhakar Raghavan
SIAM Journal on Computing
30
(3), 2000, pp. 906-922
Asymptotic behavior of the height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
Charles Knessl
,
Wojciech Szpankowski
SIAM Journal on Computing
30
(3), 2000, pp. 923-964
Simple confluently persistent catenable lists
Haim Kaplan
,
Chris Okasaki
,
Robert E. Tarjan
SIAM Journal on Computing
30
(3), 2000, pp. 965-977
Approximating the stretch factor of Euclidean graphs
Giri Narasimhan
,
Michiel Smid
SIAM Journal on Computing
30
(3), 2000, pp. 978-989
The formula isomorphism problem
Manindra Agrawal
,
Thomas Thierauf
SIAM Journal on Computing
30
(3), 2000, pp. 990-1009
The computational complexity to evaluate representations of general linear groups
Peter Bürgisser
SIAM Journal on Computing
30
(3), 2000, pp. 1010-1022
The computational complexity of immanants
Peter Bürgisser
SIAM Journal on Computing
30
(3), 2000, pp. 1023-1040
An algorithmic regularity lemma for hypergraphs
Andrzej Czygrinow
,
Vojtech Rödl
SIAM Journal on Computing
30
(4), 2000, pp. 1041-1066
A polynomial approximation algorithm for the minimum fill-in problem
Assaf Natanzon
,
Ron Shamir
,
Roded Sharan
SIAM Journal on Computing
30
(4), 2000, pp. 1067-1079
Parallel complexity of computations with general and Toeplitz-like matrices filled with integers and extensions
Victor Y. Pan
SIAM Journal on Computing
30
(4), 2000, pp. 1080-1125
From static to dynamic routing: Efficient transformations of store-and-forward protocols
Christian Scheideler
,
Berthold Vöcking
SIAM Journal on Computing
30
(4), 2000, pp. 1126-1155
Determining consensus numbers
Eric Ruppert
SIAM Journal on Computing
30
(4), 2000, pp. 1156-1168
Early detection of message forwarding faults
Amir Herzberg
,
Shay Kutten
SIAM Journal on Computing
30
(4), 2000, pp. 1169-1196
Seiten
<
1
2
3
4
5
6
>