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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A randomized maximum-flow algorithm
Joseph Cheriyan
,
Torben Hagerup
SIAM Journal on Computing
24
(2), 1995, pp. 203-226
Sparse approximate solutions to linear systems
B.K. Natarajan
SIAM Journal on Computing
24
(2), 1995, pp. 227-234
A heuristic scheduling of independent tasks with bottleneck resource constraints
Qingzhou Wang
,
Ernst L. Leiss
SIAM Journal on Computing
24
(2), 1995, pp. 235-241
On computing algebraic functions using logarithms and exponentials
Dima Grigoriev
,
Michael Singer
,
Andrew Yao
SIAM Journal on Computing
24
(2), 1995, pp. 242-246
Algorithms for enumerating all spanning trees of undirected and weighted graphs
Sanjiv Kapoor
,
H. Ramesh
SIAM Journal on Computing
24
(2), 1995, pp. 247-265
Permuting in place
Faith E. Fich
,
J. Ian Munro
,
Patricio V. Poblete
SIAM Journal on Computing
24
(2), 1995, pp. 266-278
The complexity and distribution of hard problems
David W. Juedes
,
Jack H. Lutz
SIAM Journal on Computing
24
(2), 1995, pp. 279-295
A general approximation technique for constrained forest problems
Michel X. Goemans
,
David P. Williamson
SIAM Journal on Computing
24
(2), 1995, pp. 296-317
\mbox{D}^{over}
: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems
Gilad Koren
,
Dennis Shasha
SIAM Journal on Computing
24
(2), 1995, pp. 318-339
Ordered and unordered tree inclusion
Pekka Kilpeläinen
,
Heikki Mannila
SIAM Journal on Computing
24
(2), 1995, pp. 340-356
Randomized interpolation and approximation of sparse polynomials
Yishay Mansour
SIAM Journal on Computing
24
(2), 1995, pp. 357-368
An
NC
algorithm for evaluating monotone planar circuits
A.L. Delcher
,
S. Rao Kosaraju
SIAM Journal on Computing
24
(2), 1995, pp. 369-375
Private computations over the integers
Benny Chor
,
Mihály Geréb-Graus
,
Eyal Kushilevitz
SIAM Journal on Computing
24
(2), 1995, pp. 376-386
Sparse polynomial interpolation in nonstandard bases
Y.N. Lakshman
,
B. David Saunders
SIAM Journal on Computing
24
(2), 1995, pp. 387-397
A new approach to formal language theory by Kolmogorov complexity
Ming Li
,
Paul Vitányi
SIAM Journal on Computing
24
(2), 1995, pp. 398-410
O(M\cdot N)
algorithms for the recognition and isomorphism problems on circular-arc graphs
Wen-Lian Hsu
SIAM Journal on Computing
24
(3), 1995, pp. 411-439
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
Ajit Agrawal
,
Philip Klein
,
R. Ravi
SIAM Journal on Computing
24
(3), 1995, pp. 440-456
Rectilinear path problems among rectilinear obstacles revisited
Chung-Do Yang
,
D.T. Lee
,
C.K. Wong
SIAM Journal on Computing
24
(3), 1995, pp. 457-472
Evaluation of polynomials using the structure of the coefficients
Jürg Ganz
SIAM Journal on Computing
24
(3), 1995, pp. 473-483
Scaling algorithms for the shortest paths problem
Andrew V. Goldberg
SIAM Journal on Computing
24
(3), 1995, pp. 494-504
Counterexamples for directed and node capacitated cut-trees
András A. Benczúr
SIAM Journal on Computing
24
(3), 1995, pp. 505-510
Tree reconstruction from partial orders
Sampath K. Kannan
,
Tandy J. Warnow
SIAM Journal on Computing
24
(3), 1995, pp. 511-519
A generalization of the suffix tree to square matrices, with applications
Raffaele Giancarlo
SIAM Journal on Computing
24
(3), 1995, pp. 520-562
Efficient algorithms for the Hitchcock transportation problem
Takeshi Tokuyama
,
Jun Nakano
SIAM Journal on Computing
24
(3), 1995, pp. 563-578
Approximate max-flow on small depth networks
Edith Cohen
SIAM Journal on Computing
24
(3), 1995, pp. 579-597
Seiten 1
2
>