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
[1]
Hilfe
Suche: Series=LNCS AND Volume=700
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New decidability results concerning two-way counter machines and applications
Oscar H. Ibarra
,
Tao Jiang
,
Nicholas Tran
,
Hui Wang
Lecture Notes in Computer Science
700
, 1993, pp. 313-324
Cobham's theorem seen through Büchi's theorem
Christian Michaux
,
Roger Villemaire
Lecture Notes in Computer Science
700
, 1993, pp. 325-334
Logical definability on infinite traces
Werner Ebinger
,
Anca Muscholl
Lecture Notes in Computer Science
700
, 1993, pp. 335-346
Algebras for classifying regular tree languages and an application to frontier testability
Thomas Wilke
Lecture Notes in Computer Science
700
, 1993, pp. 347-358
Finite automata as characterizations of minor closed tree families
Arvind Gupta
Lecture Notes in Computer Science
700
, 1993, pp. 359-370
On distributed algorithms in a broadcast domain
Danny Dolev
,
Dalia Malki
Lecture Notes in Computer Science
700
, 1993, pp. 371-387
Sparse networks supporting efficient reliable broadcasting
Bogdan S. Chlebus
,
Krzysztof Diks
,
Andrzej Pelc
Lecture Notes in Computer Science
700
, 1993, pp. 388-397
Strongly adaptive token distribution
Friedhelm Meyer auf der Heide
,
Brigitte Oesterdiekhoff
,
Rolf Wanka
Lecture Notes in Computer Science
700
, 1993, pp. 398-409
Fast parallel computations of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
Arnold Schönhage
Lecture Notes in Computer Science
700
, 1993, pp. 410-417
Fast parallel constraint satisfaction
Lefteris M. Kirousis
Lecture Notes in Computer Science
700
, 1993, pp. 418-429
The product of rational languages
Imre Simon
Lecture Notes in Computer Science
700
, 1993, pp. 430-444
On regular compatibility of semi-commutations
Edward Ochmański
,
Pierre-André Wacrenier
Lecture Notes in Computer Science
700
, 1993, pp. 445-456
Algebraic aspects of B-regular series
Ph. Dumas
Lecture Notes in Computer Science
700
, 1993, pp. 457-468
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Lecture Notes in Computer Science
700
, 1993, pp. 469-477
An effective version of Stallings' theorem in the case of context-free groups
Géraud Sénizergues
Lecture Notes in Computer Science
700
, 1993, pp. 478-495
On the power of periodic iteration of morphisms
Arto Lepistö
Lecture Notes in Computer Science
700
, 1993, pp. 496-506
If a D0L language is
k
-power free then it is circular
Filippo Mignosi
,
Patrice Séébold
Lecture Notes in Computer Science
700
, 1993, pp. 507-518
Deciding true concurrency equivalences on finite safe nets
Lalita Jategaonkar
,
Albert R. Meyer
Lecture Notes in Computer Science
700
, 1993, pp. 519-531
Timed testing of concurrent systems
Walter Vogler
Lecture Notes in Computer Science
700
, 1993, pp. 532-543
The fork calculus
Klaus Havelung
,
Kim G. Larsen
Lecture Notes in Computer Science
700
, 1993, pp. 544-557
Extended transition systems for parametric bisimulation
Paolo Inverardi
,
Corrado Priami
,
Daniel Yankelevich
Lecture Notes in Computer Science
700
, 1993, pp. 558-569
Temporal logic and categories of Petri nets
Carolyn Brown
,
Doug Gurr
Lecture Notes in Computer Science
700
, 1993, pp. 570-581
Decidability of a partial order based temporal logic
Kamal Lodaya
,
R. Ramanujam
,
P.S. Thiagarajan
Lecture Notes in Computer Science
700
, 1993, pp. 582-592
Local model checking for context-free processes
Hardi Hungar
,
Bernhard Steffen
Lecture Notes in Computer Science
700
, 1993, pp. 593-605
Computing on structures
Serge Abiteboul
,
Victor Vianu
Lecture Notes in Computer Science
700
, 1993, pp. 606-620
Seiten
<
1
2
3
>