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 Volume=1256
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficiency of asynchronous systems and read arcs in Petri nets
Walter Vogler
Lecture Notes in Computer Science
1256
, 1997, pp. 538-548
Bisimulation equivalence is decidable for one-counter processes
Petr Janc̑ar
Lecture Notes in Computer Science
1256
, 1997, pp. 549-559
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Ahmed Bouajjani
,
Peter Habermehl
Lecture Notes in Computer Science
1256
, 1997, pp. 560-570
Axiomatizations for the perpetual loop in process algebra
Wan Fokkink
Lecture Notes in Computer Science
1256
, 1997, pp. 571-581
Discrete-time control for rectangular hybrid automata
Thomas A. Henzinger
,
Peter W. Kopke
Lecture Notes in Computer Science
1256
, 1997, pp. 582-593
Maintaining minimum spanning trees in dynamic graphs
Monika R. Henzinger
,
Valerie King
Lecture Notes in Computer Science
1256
, 1997, pp. 594-604
Efficient splitting and merging algorithms for order decomposable problems
Roberto Grossi
,
Giuseppe F. Italiano
Lecture Notes in Computer Science
1256
, 1997, pp. 605-615
Efficient array partitioning
Sanjeev Khanna
,
S. Muthukrishnan
,
Steven Skiena
Lecture Notes in Computer Science
1256
, 1997, pp. 616-626
Constructive linear time algorithms for branchwidth
Hans L. Bodlaender
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
1256
, 1997, pp. 627-637
The word matching problem is undecidable for finite special string-rewriting systems that are confluent
Paliath Narendran
,
Friedrich Otto
Lecture Notes in Computer Science
1256
, 1997, pp. 638-648
The geometry of orthogonal reduction spaces
Zurab Khasidashvili
,
John Glauert
Lecture Notes in Computer Science
1256
, 1997, pp. 649-659
The theory of vaccines
Massimo Marchiori
Lecture Notes in Computer Science
1256
, 1997, pp. 660-670
The equivalence problem for deterministic pushdown automata is decidable
Géraud Sénizergues
Lecture Notes in Computer Science
1256
, 1997, pp. 671-681
On recognizable and rational formal power series in partially commuting variables
Manfred Droste
,
Paul Gastin
Lecture Notes in Computer Science
1256
, 1997, pp. 682-692
On a conjecture of J. Shallit
Julien Cassaigne
Lecture Notes in Computer Science
1256
, 1997, pp. 693-704
On characterizations of escrow encryption schemes
Yair Frankel
,
Moti Yung
Lecture Notes in Computer Science
1256
, 1997, pp. 705-715
Randomness-efficient non-interactive zero knowledge
Alfredo de Santis
,
Giovanni di Crescenzo
,
Pino Persiano
Lecture Notes in Computer Science
1256
, 1997, pp. 716-726
Approximation results for the optimum cost chromatic partition problem
Klaus Jansen
Lecture Notes in Computer Science
1256
, 1997, pp. 727-737
The minimum color sum of bipartite graphs
Amotz Bar-Noy
,
Guy Kortsarz
Lecture Notes in Computer Science
1256
, 1997, pp. 738-748
A primal-dual approach to approximation of node-deletion problems for matroidal properties
Toshihiro Fujito
Lecture Notes in Computer Science
1256
, 1997, pp. 749-759
Independent sets in asteroidal triple-free graphs
Hajo Broersma
,
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Lecture Notes in Computer Science
1256
, 1997, pp. 760-770
Refining and compressing abstract domains
Roberto Giacobazzi
,
Francesco Ranzato
Lecture Notes in Computer Science
1256
, 1997, pp. 771-781
Labelled reductions, runtime errors, and operational subsumption
Laurent Dami
Lecture Notes in Computer Science
1256
, 1997, pp. 782-793
A complete and efficiently computable topological classification of
D
-dimensional linear cellular automata over
Z_m
Giovanni Manzini
,
Luciano Margara
Lecture Notes in Computer Science
1256
, 1997, pp. 794-804
Recognizability equals definability for partial
k
-paths
Valentine Kabanets
Lecture Notes in Computer Science
1256
, 1997, pp. 805-815
Seiten
<
1
2
3
4
>