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=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Full intersection types and topologies in lambda calculus
Silvia Ghilezan
Journal of Computer and System Sciences
62
(1), 2001, pp. 1-14
Semantics and expressive power of nondeterministic constructs in deductive databases
Fosca Giannotti
,
Dino Pedreschi
,
Carlo Zaniolo
Journal of Computer and System Sciences
62
(1), 2001, pp. 15-42
Belief revision and update: Complexity of model checking
Paolo Liberatore
,
Marco Schaerf
Journal of Computer and System Sciences
62
(1), 2001, pp. 43-72
A process-calculus analysis of concurrent operations on B-trees
Anna Philippou
,
David Walker
Journal of Computer and System Sciences
62
(1), 2001, pp. 73-122
Agnostic learning of geometric patterns
Sally A. Goldman
,
Stephen S. Kwek
,
Stephen D. Scott
Journal of Computer and System Sciences
62
(1), 2001, pp. 123-151
On the benefit of supporting virtual channels in wormhole routers
Richard J. Cole
,
Bruce M. Maggs
,
Ramesh K. Sitaraman
Journal of Computer and System Sciences
62
(1), 2001, pp. 152-177
Robust learning is rich
Sanjay Jain
,
Carl Smith
,
Rolf Wiehagen
Journal of Computer and System Sciences
62
(1), 2001, pp. 178-212
Computational arithmetic geometry - I. Sentences nearly in the polynomial hierarchy
J. Maurice Rojas
Journal of Computer and System Sciences
62
(2), 2001, pp. 216-235
Pseudorandom generators without the XOR lemma
Madhu Sudan
,
Luca Trevisan
,
Sahil Vadhan
Journal of Computer and System Sciences
62
(2), 2001, pp. 236-266
Linear gaps between degrees for the polynomial calculus modulo distinct primes
Sam Buss
,
Dima Grigoriev
,
Russell Impagliazzo
,
Toniann Pitassi
Journal of Computer and System Sciences
62
(2), 2001, pp. 267-289
Graph Ramsey theory and the polynomial hierarchy
Marcus Schaefer
Journal of Computer and System Sciences
62
(2), 2001, pp. 290-322
The communication complexity of pointer chasing
Stephen J. Ponzio
,
Jaikumar Radhakrishnan
,
S. Venkatesh
Journal of Computer and System Sciences
62
(2), 2001, pp. 323-355
A lower bound for primality
Eric Allender
,
Michael Saks
,
Igor Shparlinski
Journal of Computer and System Sciences
62
(2), 2001, pp. 356-366
On the complexity of
k
-SAT
Russell Impagliazzo
,
Ramamohan Paturi
Journal of Computer and System Sciences
62
(2), 2001, pp. 367-375
Quantum simulations of classical random walks and undirected graph connectivity
John Watrous
Journal of Computer and System Sciences
62
(2), 2001, pp. 376-391
Competitive routing of virtual circuits with unknown duration
Baruch Awerbuch
,
Yossi Azar
,
Serge Plotkin
,
Orli Waarts
Journal of Computer and System Sciences
62
(3), 2001, pp. 385-397
Parallel output-sensitive algorithms for combinatorial and linear algebra problems
John H. Reif
Journal of Computer and System Sciences
62
(3), 2001, pp. 398-412
Synthesizing learners tolerating computable noisy data
John Case
,
Sanjay Jain
Journal of Computer and System Sciences
62
(3), 2001, pp. 413-441
The stability of saturated linear dynamical systems is undecidable
Vincent D. Blondel
,
Olivier Bournez
,
Pascal Koiran
,
John N. Tsitsiklis
Journal of Computer and System Sciences
62
(3), 2001, pp. 442-462
On ACTL formulas having linear counterexamples
Francesco Buccafurri
,
Thomas Eiter
,
Georg Gottlob
,
Nicola Leone
Journal of Computer and System Sciences
62
(3), 2001, pp. 463-515
Improved bounds on the sample complexity of learning
Yi Li
,
Philip M. Long
,
Aravind Srinivasan
Journal of Computer and System Sciences
62
(3), 2001, pp. 516-527
Estimation on domain of attraction and convergence rate of Hopfield continuous feedback neural networks
Jinde Cao
,
Qing Tao
Journal of Computer and System Sciences
62
(3), 2001, pp. 528-534
Refinements of complexity results on type consistency for object-oriented databases
Yasunori Ishihara
,
Shougo Shimizu
,
Hiroyuki Seki
,
Minoru Ito
Journal of Computer and System Sciences
62
(4), 2001, pp. 537-564
Translating regular expressions into small
\epsilon
-free nondeterministic finite automata
Juraj Hromkovic̑
,
Sebastian Seibert
,
Thomas Wilke
Journal of Computer and System Sciences
62
(4), 2001, pp. 565-588
Linear-constistency testing
Yonatan Aumann
,
Johan Håstad
,
Michael O. Rabin
,
Madhu Sudan
Journal of Computer and System Sciences
62
(4), 2001, pp. 589-607
Seiten 1
2
>