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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comparison of functional and predicative query paradigms
Catriel Beeri
,
Tova Milo
Journal of Computer and System Sciences
54
(1), 1997, pp. 3-33
A semideterministic approach to object creation and nondeterminism in database queries
Jan van den Bussche
,
Dirk van Gucht
Journal of Computer and System Sciences
54
(1), 1997, pp. 34-47
Tie-breaking semantics and structural totality
Christos H. Papadimitriou
,
Mihalis Yannakakis
Journal of Computer and System Sciences
54
(1), 1997, pp. 48-60
On the equivalence of recursive and nonrecursive Datalog programs
Surajit Chaudhuri
,
Moshe Y. Vardi
Journal of Computer and System Sciences
54
(1), 1997, pp. 61-78
Monotonic aggregation in deductive databases
Kenneth A. Ross
,
Yehoshua Sagiv
Journal of Computer and System Sciences
54
(1), 1997, pp. 79-97
Knowledgebase transformations
Gösta Grahne
,
Alberto O. Mendelzon
,
Peter Z. Revesz
Journal of Computer and System Sciences
54
(1), 1997, pp. 98-112
The complexity of querying indefinite data about linearly ordered domains
Ron van der Meyden
Journal of Computer and System Sciences
54
(1), 1997, pp. 113-135
Reusing and modifying rulebases by predicate substitution
Anthony J. Bonner
,
Tomasz Imielinski
Journal of Computer and System Sciences
54
(1), 1997, pp. 136-166
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
Marek Karpinski
,
Angus Macintyre
Journal of Computer and System Sciences
54
(1), 1997, pp. 169-176
A weak version of the Blum, Shub, and Smale model
Pascal Koiran
Journal of Computer and System Sciences
54
(1), 1997, pp. 177-189
Neural networks with quadratic VC dimension
Pascal Koiran
,
Eduardo D. Sontag
Journal of Computer and System Sciences
54
(1), 1997, pp. 190-198
On the computation of Boolean functions by analog circuits of bounded fan-in
György Turán
,
Farrokh Vatan
Journal of Computer and System Sciences
54
(1), 1997, pp. 199-212
Fully parallelized multi-prover protocols for NEXP-time
Dror Lapidot
,
Adi Shamir
Journal of Computer and System Sciences
54
(2), 1997, pp. 215-220
Better lower bounds for monotone threshold formulas
Jaikumar Radhakrishnan
Journal of Computer and System Sciences
54
(2), 1997, pp. 221-226
Connected components in
O(\log^{3/2}n)
parallel time for the CREW PRAM
Donald B. Johnson
,
Panagiotis Metaxas
Journal of Computer and System Sciences
54
(2), 1997, pp. 227-242
All pairs shortest paths for graphs with small integer length edges
Zvi Galil
,
Oded Margalit
Journal of Computer and System Sciences
54
(2), 1997, pp. 243-254
On the exponent of the all pairs shortest path problem
Noga Alon
,
Zvi Galil
,
Oded Margalit
Journal of Computer and System Sciences
54
(2), 1997, pp. 255-262
Breaking the
\Theta(n\log^2n)
barrier for sorting with faults
Tom Leighton
,
Yuan Ma
,
C. Greg Plaxton
Journal of Computer and System Sciences
54
(2), 1997, pp. 265-304
A spectrum of time-space trade-offs for undirected
s-t
connectivity
Uriel Feige
Journal of Computer and System Sciences
54
(2), 1997, pp. 305-316
The hardness of approximate optima in lattices, codes, and systems of linear equations
Sanjeev Arora
,
László Babai
,
Jacques Stern
,
Z. Sweedyk
Journal of Computer and System Sciences
54
(2), 1997, pp. 317-331
Efficient out-of-core algorithms for linear relaxation using blocking covers
Charles E. Leiserson
,
Satish Rao
,
Sivan Toledo
Journal of Computer and System Sciences
54
(2), 1997, pp. 332-344
When can we sort in
o(n\log n)
time?
Amir M. Ben-Amram
,
Zvi Galil
Journal of Computer and System Sciences
54
(2), 1997, pp. 345-370
Learning an intersection of a constant number of halfspaces over a uniform distribution
Avrim L. Blum
,
Ravindran Kannan
Journal of Computer and System Sciences
54
(2), 1997, pp. 371-380
DSPACE(n)\stackrel{?}{=}NSPACE(n)
: A degree theoretic characterization
Manindra Agrawal
Journal of Computer and System Sciences
54
(3), 1997, pp. 383-392
An excursion to the Kolmogorov random strings
Harry Buhrman
,
Elvira Mayordomo
Journal of Computer and System Sciences
54
(3), 1997, pp. 393-399
Seiten 1
2
>