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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on ``A linear-time algorithm for computing
k
-terminal reliability in a series-parallel network''
A. Satyanarayana
,
R.K. Wood
,
L. Camarinopoulos
,
G. Pampoukis
SIAM Journal on Computing
25
(2), 1996, pp. 290
Asymptotic conditional probabilities: The unary case
Adam J. Grove
,
Joseph Y. Halpern
,
Daphne Koller
SIAM Journal on Computing
25
(1), 1996, pp. 1-51
A fast derandomization scheme and its applications
Yijie Han
SIAM Journal on Computing
25
(1), 1996, pp. 52-82
Weighted multidimensional search and its application to convex optimization
Richa Agarwala
,
David Fernández-Baca
SIAM Journal on Computing
25
(1), 1996, pp. 83-99
Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions
Pankaj K. Agarwal
,
Micha Sharir
SIAM Journal on Computing
25
(1), 1996, pp. 100-116
A new characterization of type-2 feasibility
B.M. Kapron
,
S.A. Cook
SIAM Journal on Computing
25
(1), 1996, pp. 117-132
Linear time and memory-efficient computation
Kenneth W. Regan
SIAM Journal on Computing
25
(1), 1996, pp. 133-168
Approximate max-flow min-(multi)cut theorems and their applications
Naveen Garg
,
Vijay V. Vazirani
,
Mihalis Yannakakis
SIAM Journal on Computing
25
(2), 1996, pp. 235-251
Robust characterizations of polynomials with applications to program testing
Ronitt Rubinfeld
,
Madhu Sudan
SIAM Journal on Computing
25
(2), 1996, pp. 252-271
Genome rearrangements and sorting by reversals
Vineet Bafna
,
Pavel A. Pevzner
SIAM Journal on Computing
25
(2), 1996, pp. 272-289
Upward planar drawing of single-source acyclic digraphs
Michael D. Hutton
,
Anna Lubiw
SIAM Journal on Computing
25
(2), 1996, pp. 291-311
An efficient parallel algorithm for the general planar monotone circuit value problem
Vijaya Ramachandran
,
Honghua Yang
SIAM Journal on Computing
25
(2), 1996, pp. 312-339
The boolean hierarchy and the polynomial hierarchy: A closer connection
Richard Chang
,
Jim Kadin
SIAM Journal on Computing
25
(2), 1996, pp. 340-354
Low-degree spanning trees of small weight
Samir Khuller
,
Balaji Raghavachari
,
Neal Young
SIAM Journal on Computing
25
(2), 1996, pp. 355-368
Optimal clock synchronization under different delay assumptions
Hagit Attiya
,
Amir Herzberg
,
Sergio Rajsbaum
SIAM Journal on Computing
25
(2), 1996, pp. 369-389
Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs
Xiaotie Deng
,
Pavol Hell
,
Jing Huang
SIAM Journal on Computing
25
(2), 1996, pp. 390-403
An
O(n+m)
-time algorithm for finding a minimum-weight dominating set in a permutation graph
C. Rhee
,
Y.D. Liang
,
S.K. Dhall
,
S. Lakshmivarahan
SIAM Journal on Computing
25
(2), 1996, pp. 404-419
Generalized Kraft's inequality and discrete
k
-modal search
Anmol Mathur
,
Edward M. Reingold
SIAM Journal on Computing
25
(2), 1996, pp. 420-447
An algebraic model for combinatorial problems
Richard E. Stearns
,
Harry B. Hunt III
SIAM Journal on Computing
25
(2), 1996, pp. 448-476
Strongly competitive algorithms for paging with locality of reference
Sandy Irani
,
Anna R. Karlin
,
Steven Phillips
SIAM Journal on Computing
25
(3), 1996, pp. 477-497
On the value of coordination in distributed decision making
Sandy Irani
,
Yuval Rabani
SIAM Journal on Computing
25
(3), 1996, pp. 498-519
Complexity of sub-bus mesh computations
Anne Condon
,
Richard Ladner
,
Jordan Lampe
,
Rakesh Sinha
SIAM Journal on Computing
25
(3), 1996, pp. 520-539
Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques
Haim Kaplan
,
Ron Shamir
SIAM Journal on Computing
25
(3), 1996, pp. 540-561
Efficiently planning compliant motion in the plane
J. Friedman
,
J. Hershberger
,
J. Snoeyink
SIAM Journal on Computing
25
(3), 1996, pp. 562-599
On-line algorithms for path selection in a nonblocking network
Sanjeev Arora
,
F.T. Leighton
,
Bruce M. Maggs
SIAM Journal on Computing
25
(3), 1996, pp. 600-625
Seiten 1
2
>