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 YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An
O(n)
algorithm for Abelian
p
-group isomorphism and an
O(n\log n)
algorithm for Abelian group isomorphism
Narayan Vikas
Journal of Computer and System Sciences
53
(1), 1996, pp. 1-9
Automaticity I: Properties of a measure of descriptional complexity
Jeffrey Shallit
,
Yuri Breitbart
Journal of Computer and System Sciences
53
(1), 1996, pp. 10-25
Learnability: Admissible, co-finite, and hypersimple languages
Ganesh Baliga
,
John Case
Journal of Computer and System Sciences
53
(1), 1996, pp. 26-32
Language theoretic and algorithmic properties of
d
-dimensional collages and patterns in a grid
Frank Drewes
Journal of Computer and System Sciences
53
(1), 1996, pp. 33-60
Concurrent counting
Shlomo Moran
,
Gadi Taubenfeld
,
Irit Yadin
Journal of Computer and System Sciences
53
(1), 1996, pp. 61-78
New lower bounds and hierarchy results for restricted branching programs
Detlef Sieling
Journal of Computer and System Sciences
53
(1), 1996, pp. 79-87
Incremental learning from positive data
Steffen Lange
,
Thomas Zeugmann
Journal of Computer and System Sciences
53
(1), 1996, pp. 88-103
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Faith E. Fich
,
Russell Impagliazzo
,
Bruce Kapron
,
Valerie King
,
Mirosƚaw Kutyƚowski
Journal of Computer and System Sciences
53
(1), 1996, pp. 104-111
Towards structured parallel computing on architecture-independent parallel algorithm design for distributed-memory architectures
Feng Gao
Journal of Computer and System Sciences
53
(1), 1996, pp. 112-128
Efficient theoretic and practical algorithms for linear matroid intersection problems
Harold N. Gabow
,
Ying Xu
Journal of Computer and System Sciences
53
(1), 1996, pp. 129-147
A space efficient variant of path copying for partially persistent sorted sets
Paul F. Dietz
Journal of Computer and System Sciences
53
(1), 1996, pp. 148-152
Polynomial-time isomorphism of 1-L-complete sets
Manindra Agrawal
,
Somenath Biswas
Journal of Computer and System Sciences
53
(2), 1996, pp. 155-160
On limited nondeterminism and the complexity of the V-C dimension
Christos H. Papadimitriou
,
Mihalis Yannakakis
Journal of Computer and System Sciences
53
(2), 1996, pp. 161-170
On clusure properties of
\#\P
in the context of
PF\circ\#\P
Mitsunori Ogihara
,
Thomas Thierauf
,
Seinosuke Toda
,
Osamu Watanabe
Journal of Computer and System Sciences
53
(2), 1996, pp. 171-179
Taking it to the limit: On infinite variants of
NP
-complete problems
Tirza Hirst
,
David Harel
Journal of Computer and System Sciences
53
(2), 1996, pp. 180-193
\P
-selective sets and reducing search to decision vs self-reducibility
Edith Hemaspaandra
,
Ashish V. Naik
,
Mitsunori Ogihara
,
Alan L. Selman
Journal of Computer and System Sciences
53
(2), 1996, pp. 194-209
\P
-selective self-reducible sets: A new characterization of
\P
Harry Buhrman
,
Leen Torenvliet
Journal of Computer and System Sciences
53
(2), 1996, pp. 210-217
Pointers versus arithmetic in PRAMs
Patrick W. Dymond
,
Faith E. Fich
,
Naomi Nishimura
,
Prabhakar Ragde
,
Walter L. Ruzzo
Journal of Computer and System Sciences
53
(2), 1996, pp. 218-232
Relative to a random oracle,
NP
is not small
Steven M. Kautz
,
Peter Bro Miltersen
Journal of Computer and System Sciences
53
(2), 1996, pp. 235-250
Multi-prover encoding schemes and three-prover proof systems
Gábor Tardos
Journal of Computer and System Sciences
53
(2), 1996, pp. 251-260
Random strings make hard instances
Harry Buhrman
,
Pekka Orponen
Journal of Computer and System Sciences
53
(2), 1996, pp. 261-266
On the isomorphism conjecture for weak reducibilities
Manindra Agrawal
Journal of Computer and System Sciences
53
(2), 1996, pp. 267-282
Logical definability of counting functions
Kevin J. Compton
,
Erich Grädel
Journal of Computer and System Sciences
53
(2), 1996, pp. 283-297
On the query complexity of clique size and maximum satisfiability
Richard Chang
Journal of Computer and System Sciences
53
(2), 1996, pp. 298-313
Bounds on the greedy routing algorithm for array networks
Michael Mitzenmacher
Journal of Computer and System Sciences
53
(3), 1996, pp. 317-327
Seiten 1
2
3
4
>