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
[2]
Hilfe
Suche: Series=LNCS AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
An improved deterministic algorithm for generalized random sampling
Amihood Amir
,
Emanuel Dar
Lecture Notes in Computer Science
1203
, 1997, pp. 159-170
An improved deterministic algorithm for generalized random sampling
Amihood Amir
,
Emanuel Dar
Lecture Notes in Computer Science
1203
, 1997, pp. 159-170
Polynomial time algorithms for some self-duality problems
Carlos Domingo
Lecture Notes in Computer Science
1203
, 1997, pp. 171-180
Polynomial time algorithms for some self-duality problems
Carlos Domingo
Lecture Notes in Computer Science
1203
, 1997, pp. 171-180
The algorithmic complexity of chemical threshold testing
Peter Damaschke
Lecture Notes in Computer Science
1203
, 1997, pp. 205-216
The algorithmic complexity of chemical threshold testing
Peter Damaschke
Lecture Notes in Computer Science
1203
, 1997, pp. 205-216
Topological chaos for elementary cellular automata
Gianpiero Cattaneo
,
Michele Finelli
,
Luciano Margara
Lecture Notes in Computer Science
1203
, 1997, pp. 241-252
Topological chaos for elementary cellular automata
Gianpiero Cattaneo
,
Michele Finelli
,
Luciano Margara
Lecture Notes in Computer Science
1203
, 1997, pp. 241-252
On the complexity of balanced Boolean functions
A. Bernasconi
Lecture Notes in Computer Science
1203
, 1997, pp. 253-263
On the complexity of balanced Boolean functions
A. Bernasconi
Lecture Notes in Computer Science
1203
, 1997, pp. 253-263
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
Predecessor queries in dynamic integer sets
Gert Stlting Brodal
Lecture Notes in Computer Science
1200
, 1997, pp. 21-32
Resource-bounded Kolmogorov complexity revisited
Harry Buhrman
,
Lance Fortnow
Lecture Notes in Computer Science
1200
, 1997, pp. 105-116
MOD
_p
-tests, almost independence and small probability spaces
Claudia Bertram-Kretzberg
,
Hanno Lefmann
Lecture Notes in Computer Science
1200
, 1997, pp. 141-152
Gossiping and broadcasting versus computing functions in networks
Martin Dietzfelbinger
Lecture Notes in Computer Science
1200
, 1997, pp. 189-200
On the classification of computable languages
John Case
,
Efim Kinber
,
Arun Sharma
,
Frank Stephan
Lecture Notes in Computer Science
1200
, 1997, pp. 225-236
Efficient constructions of hitting sets for systems of linear functions
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Lecture Notes in Computer Science
1200
, 1997, pp. 387-398
Protocols for collusion-secure asymmetric fingerprinting
Ingrid Biehl
,
Bernd Meyer
Lecture Notes in Computer Science
1200
, 1997, pp. 399-412
On ergodic linear cellular automata over
Z_m
Gianpiero Cattaneo
,
Enrico Formenti
,
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1200
, 1997, pp. 427-438
The computational complexity of some problems of linear algebra
Jonathan F. Buss
,
Gudmund S. Frandsen
,
Jeffrey O. Shallit
Lecture Notes in Computer Science
1200
, 1997, pp. 451-462
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>