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
[1]
Hilfe
Suche: Journal=SIAM J. Comput. AND Volume=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal approximations and polynomially levelable sets
P. Orponen
,
D.A. Russo
,
U. Schöning
SIAM Journal on Computing
15
(2), 1986, May, pp. 399-408
Probabilistic bounds on the performance of list scheduling
J.L. Bruno
,
P.J. Downey
SIAM Journal on Computing
15
(2), 1986, May, pp. 409-417
Minimal representation of directed hypergraphs
G. Ausiello
,
A. d'Atri
,
D. Saccá
SIAM Journal on Computing
15
(2), 1986, May, pp. 418-431
Representations and parallel computations for rational functions
J. von zur Gathen
SIAM Journal on Computing
15
(2), 1986, May, pp. 432-452
On the complexity of nonconvex covering
W. Maass
SIAM Journal on Computing
15
(2), 1986, May, pp. 453-467
Log-logarithmic selection resolution protocols in a multiple access channel
D.E. Willard
SIAM Journal on Computing
15
(2), 1986, May, pp. 468-477
Efficient algorithms for geometric graph search problems
H. Imai
,
T. Asano
SIAM Journal on Computing
15
(2), 1986, May, pp. 478-494
Planar multicommodity flows, maximum matchings and negative cycles
K. Matsumoto
,
T. Nishizeki
,
N. Saito
SIAM Journal on Computing
15
(2), 1986, May, pp. 495-510
Relativizations of unambiguous and random polynomial time classes
J. Geske
,
J. Grollmann
SIAM Journal on Computing
15
(2), 1986, May, pp. 511-519
Probabilities related to father-son distances in binary search trees
C.E. Langenhop
,
W.E. Wright
SIAM Journal on Computing
15
(2), 1986, May, pp. 520-530
Negation is powerless for boolean slice functions
L.G. Valiant
SIAM Journal on Computing
15
(2), 1986, May, pp. 531-535
On the Lagarias-Odlyzko algorithm for the subset sum problem
A.M. Frieze
SIAM Journal on Computing
15
(2), 1986, May, pp. 536-539
Constant time generation of free trees
R.A. Wright
,
B. Richmond
,
A. Odlyzko
,
B.D. McKay
SIAM Journal on Computing
15
(2), 1986, May, pp. 540-548
Bounds for width two branching programs
A. Borodin
,
D. Dolev
,
F.E. Fich
,
W. Paul
SIAM Journal on Computing
15
(2), 1986, May, pp. 549-560
On the probable performance of heuristics for bandwidth minimization
J.S. Turner
SIAM Journal on Computing
15
(2), 1986, May, pp. 561-580
The complexity of the membership problem for two subclasses of polynomial ideals
D.T. Huynh
SIAM Journal on Computing
15
(2), 1986, May, pp. 581-594
Noncommutative bilinear algorithms for 3*3 matrix multiplication
R.W. Johnson
,
A.M. McLoughlin
SIAM Journal on Computing
15
(2), 1986, May, pp. 595-603
Collections of functions for perfect hashing
F. Berman
,
M.E. Bock
,
E. Dittert
,
M.J. O'Donnell
,
D. Plank
SIAM Journal on Computing
15
(2), 1986, May, pp. 604-618
Recognizing composite graphs is equivalent to testing graph isomorphism
J. Feigenbaum
,
A.A. Schäffer
SIAM Journal on Computing
15
(2), 1986, May, pp. 619-627
Register allocation for unary-binary trees
P. Flajolet
,
H. Prodinger
SIAM Journal on Computing
15
(3), 1986, August, pp. 629-640
Constructing
O(n\log n)
size monotone formulae for the
k
th threshold function of n Boolean variables
J. Friedman
SIAM Journal on Computing
15
(3), 1986, August, pp. 641-654
The complexity of counting stable marriages
R.W. Irving
,
P. Leather
SIAM Journal on Computing
15
(3), 1986, August, pp. 655-667
On deterministic multi-pass analysis
C. Citrini
,
S. Crespi Reghizzi
,
D. Mandrioli
SIAM Journal on Computing
15
(3), 1986, August, pp. 668-693
The complexity of reliability computations in planar and acyclic graphs
J.S. Provan
SIAM Journal on Computing
15
(3), 1986, August, pp. 694-702
Filtering search: a new approach to query-answering
B. Chazelle
SIAM Journal on Computing
15
(3), 1986, August, pp. 703-724
Seiten
<
1
2
3
4
>