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: Series=LNCS AND Volume=1853
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Revisiting the correspondence between cut elimination and normalisation
José Espírito Santo
Lecture Notes in Computer Science
1853
, 2000, pp. 600-611
Negation elimination from simple equational formulae
Reinhard Pichler
Lecture Notes in Computer Science
1853
, 2000, pp. 612-623
Hardness of set cover with intersection 1
V.S. Anil Kumar
,
Sunil Arya
,
H. Ramesh
Lecture Notes in Computer Science
1853
, 2000, pp. 624-635
Strong inapproximability of the basic
k
-spanner problem
Michael Elkin
,
David Peleg
Lecture Notes in Computer Science
1853
, 2000, pp. 636-647
Infinite series-parallel posets: Logic and languages
Dietrich Kuske
Lecture Notes in Computer Science
1853
, 2000, pp. 648-662
On deciding if deterministic Rabin language is in Büchi class
Tomasz Fryderyk Urbański
Lecture Notes in Computer Science
1853
, 2000, pp. 663-674
On message sequence graphs and finitely generated regular MSC languages
Jesper G. Henriksen
,
Madhavan Mukund
,
K. Narayan Kumar
,
P.S. Thiagarajan
Lecture Notes in Computer Science
1853
, 2000, pp. 675-686
Pseudorandomness
Oded Goldreich
Lecture Notes in Computer Science
1853
, 2000, pp. 687-704
A bound on the capacity of backoff and acknowledgement-based protocols
Leslie Ann Goldberg
,
Mark Jerrum
,
Sampath Kannan
,
Mike Paterson
Lecture Notes in Computer Science
1853
, 2000, pp. 705-716
Deterministic radio broadcasting
Bogdan S. Chlebus
,
Leszek Ga̧sieniec
,
Anna Östlin
,
John Michael Robson
Lecture Notes in Computer Science
1853
, 2000, pp. 717-728
An
\omega
-complete equational specification of interleaving
W.J. Fokking
,
S.P. Luttik
Lecture Notes in Computer Science
1853
, 2000, pp. 729-743
A complete axiomatization for observational congruence of prioritized finite-state behaviors
Mario Bravetti
,
Roberto Gorrieri
Lecture Notes in Computer Science
1853
, 2000, pp. 744-755
Tight size bounds for packet headers in narrow meshes
Micah Adler
,
Faith Fich
,
Leslie Ann Goldberg
,
Mike Paterson
Lecture Notes in Computer Science
1853
, 2000, pp. 756-767
Wavelength assignment problem on all-optical networks with
k
fibres per link
Luciano Margara
,
Janos Simon
Lecture Notes in Computer Science
1853
, 2000, pp. 768-779
On the logical characterisation of performability properties
Christel Baier
,
Boudewijn Haverkort
,
Holger Hermanns
,
Joost-Pieter Katoen
Lecture Notes in Computer Science
1853
, 2000, pp. 780-792
On the representation of timed polyhedra
Olivier Bournez
,
Oded Maler
Lecture Notes in Computer Science
1853
, 2000, pp. 793-807
Min-wise independent permutations: Theory and practice
Andrei Z. Broder
Lecture Notes in Computer Science
1853
, 2000, pp. 808-808
Testing acyclicity of directed graphs in sublinear time
Michael A. Bender
,
Dana Ron
Lecture Notes in Computer Science
1853
, 2000, pp. 809-820
Computing the girth of a planar graph
Hristo N. Djidjev
Lecture Notes in Computer Science
1853
, 2000, pp. 821-831
Lower bounds are not easier over the reals: Inside
PH
Hervé Fournier
,
Pascal Koiran
Lecture Notes in Computer Science
1853
, 2000, pp. 832-843
Unlearning helps
Ganesh Baliga
,
John Case
,
Wolfgang Merkle
,
Frank Stephan
Lecture Notes in Computer Science
1853
, 2000, pp. 844-855
Fast approximation schemes for Euclidean multi-connectivity problems
Artur Czumaj
,
Andrzej Lingas
Lecture Notes in Computer Science
1853
, 2000, pp. 856-868
Approximate TSP in graphs with forbidden minors
Michelangelo Grigni
Lecture Notes in Computer Science
1853
, 2000, pp. 869-877
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Klaus Jansen
,
Lorant Porkolab
Lecture Notes in Computer Science
1853
, 2000, pp. 878-889
The many faces of a translation
Pierre McKenzie
,
Thomas Schwentick
,
Denis Thérien
,
Heribert Vollmer
Lecture Notes in Computer Science
1853
, 2000, pp. 890-901
Seiten
<
1
2
3
4
>