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=J. Comput.~Syst.~Sci. AND Volume=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of databases queries
Christos H. Papadimitriou
,
Mihalis Yannakakis
Journal of Computer and System Sciences
58
(3), 1999, pp. 407-427
Regular path queries with constraints
Serge Abiteboul
,
Victor Vianu
Journal of Computer and System Sciences
58
(2), 1999, pp. 428-452
Cut and paste
Giansalvatore Mecca
,
Paolo Atzeni
Journal of Computer and System Sciences
58
(3), 1999, pp. 453-482
Complete geometric query languages
Marc Gyssens
,
Jan van den Bussche
,
Dirk van Gucht
Journal of Computer and System Sciences
58
(3), 1999, pp. 483-511
Equivalence of keyed relational schemas by conjunctive queries
Joseph Albert
,
Yannis Ioannidis
,
Raghu Ramakrishnan
Journal of Computer and System Sciences
58
(3), 1999, pp. 512-534
On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
Freddy Dumortier
,
Marc Gyssens
,
Luc Vandeurzen
,
Dirk van Gucht
Journal of Computer and System Sciences
58
(3), 1999, pp. 535-571
The computational complexity of some problems of linear algebra
Jonathan F. Buss
,
Gudmund S. Frandsen
,
Jeffrey O. Shallit
Journal of Computer and System Sciences
58
(3), 1999, pp. 572-596
Attractors of linear cellular automata
Giovanni Manzini
,
Luciano Margara
Journal of Computer and System Sciences
58
(3), 1999, pp. 597-610
Stack cooperation in multistack pushdown automata
Jürgen Dassow
,
Victor Mitrana
Journal of Computer and System Sciences
58
(3), 1999, pp. 611-621
Tight bound on Johnson's algorithm for maximum satisfiability
Jianer Chen
,
Donald K. Friesen
,
Hao Zheng
Journal of Computer and System Sciences
58
(3), 1999, pp. 622-640
The complexity of finding a second Hamiltonian cycle in cubic graphs
Adam Krawczyk
Journal of Computer and System Sciences
58
(3), 1999, pp. 641-647
Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
Lane A. Hemaspaandra
,
Jörg Rothe
Journal of Computer and System Sciences
58
(3), 1999, pp. 648-659
Seiten
<
1
2