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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on the representative instance in relational databases
M. Ito
,
M. Iwasaki
,
T. Kasami
SIAM Journal on Computing
14
(2), 1985, May, pp. 334-354
Rectilinear graphs and their embeddings
G.K. Vijayan
,
A. Wigderson
SIAM Journal on Computing
14
(2), 1985, May, pp. 355-372
Axioms for the theory of lambda-conversion
G. Revesz
SIAM Journal on Computing
14
(2), 1985, May, pp. 373-382
On the multiplicative complexity of modules over associative algebras
W. Hartmann
SIAM Journal on Computing
14
(2), 1985, May, pp. 383-395
Probabilistic parallel algorithms for sorting and selection
R. Reischuk
SIAM Journal on Computing
14
(2), 1985, May, pp. 396-409
An ``interchange lemma'' for context-free languages
W. Ogden
,
R.J. Ross
,
K. Winklmann
SIAM Journal on Computing
14
(2), 1985, May, pp. 410-415
A stochastic model of fragmentation in dynamic storage allocation
E.G., Jr. Coffman
,
T.T. Kadota
,
L.A. Shepp
SIAM Journal on Computing
14
(2), 1985, May, pp. 416-425
Sequential machine characterizations of trellis and cellular automata and applications
O.H. Ibarra
,
S.M. Kim
,
S. Moran
SIAM Journal on Computing
14
(2), 1985, May, pp. 426-447
Intersection and closest-pair problems for a set of planar discs
M. Sharir
SIAM Journal on Computing
14
(2), 1985, May, pp. 448-468
Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization
E. Kaltofen
SIAM Journal on Computing
14
(2), 1985, May, pp. 469-489
Optimum algorithms for a model of direct chaining
J.S. Vitter
,
Wen-Chin Chen
SIAM Journal on Computing
14
(2), 1985, May, pp. 490-499
Composing functions to minimize image size
M.R. Garey
,
D.S. Johnson
SIAM Journal on Computing
14
(2), 1985, May, pp. 500-503
Shift-register synthesis (modulo m)
J.A. Reeds
,
N.J.A. Sloane
SIAM Journal on Computing
14
(3), 1985, August, pp. 505-513
Alphabetic minimax trees
D.G. Kirkpatrick
,
M.M. Klawe
SIAM Journal on Computing
14
(3), 1985, August, pp. 514-526
Solving undirected graph problems on VLSI
S.E. Hambrusch
,
J. Simon
SIAM Journal on Computing
14
(3), 1985, August, pp. 527-544
Biased search trees
S.W. Bent
,
D.D. Sleator
,
R.E. Tarjan
SIAM Journal on Computing
14
(3), 1985, August, pp. 545-568
Priority networks of communicating finite state machines
M.G. Gouda
,
L.E. Rosier
SIAM Journal on Computing
14
(3), 1985, August, pp. 569-584
On restricting the size of oracles compared with restricting access to oracles
T.J. Long
SIAM Journal on Computing
14
(3), 1985, August, pp. 585-597
On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata
R.E. Stearns
,
H.B. Hunt III
SIAM Journal on Computing
14
(3), 1985, August, pp. 598-611
An
O(n\log^2n)
algorithm for maximum flow in undirected planar networks
R. Hassin
,
D.B. Johnson
SIAM Journal on Computing
14
(3), 1985, August, pp. 612-624
An
O(E\log E+I)
expected time algorithm for the planar segment intersection problem
E.W. Myers
SIAM Journal on Computing
14
(3), 1985, August, pp. 625-637
Scheduling flat graphs
D. Dolev
,
M. Warmuth
SIAM Journal on Computing
14
(3), 1985, August, pp. 638-657
On comparability and permutation graphs
J. Spinrad
SIAM Journal on Computing
14
(3), 1985, August, pp. 658-670
The implication problem for functional and inclusion dependencies is undecidable
A.K. Chandra
,
M.Y. Vardi
SIAM Journal on Computing
14
(3), 1985, August, pp. 671-677
A lower bound for the formula size of rational functions
K.A. Kalorkoti
SIAM Journal on Computing
14
(3), 1985, August, pp. 678-687
Seiten
<
1
2
3
>