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=820
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Undecidable verification problems for programs with unreliable channels
Parosh Aziz Abdulla
,
Bengt Jonsson
Lecture Notes in Computer Science
820
, 1994, pp. 316-327
Reasoning about programs by exploiting the environment
Limor Fix
,
Fred B. Schneider
Lecture Notes in Computer Science
820
, 1994, pp. 328-339
A model of intuitionistic affine logic from stable domain theory
Torben Bräuner
Lecture Notes in Computer Science
820
, 1994, pp. 340-351
Bistructures, bidomains and linear logic
Gordon Plotkin
,
Glynn Winskel
Lecture Notes in Computer Science
820
, 1994, pp. 352-363
Equivalences for fair Kripke structures
Adnan Aziz
,
Vigyan Singhal
,
Felice Balarin
,
Robert K. Brayton
,
Alberto L. Sangiovanni-Vincentelli
Lecture Notes in Computer Science
820
, 1994, pp. 364-375
Generalizing finiteness conditions of labelled transition systems
Franck van Breugel
Lecture Notes in Computer Science
820
, 1994, pp. 376-387
A Kleene theorem for recognizable languages over concurrency monoids
Manfred Droste
Lecture Notes in Computer Science
820
, 1994, pp. 388-399
Least solutions of equations over
{\cal N}
Helmut Seidl
Lecture Notes in Computer Science
820
, 1994, pp. 400-411
Fast uniform analysis of coupled-context-free languages
Günter Hotz
,
Gisela Pitsch
Lecture Notes in Computer Science
820
, 1994, pp. 412-423
Polynomial closure of group languages and open sets of the Hall topology
Jean-Eric Pin
Lecture Notes in Computer Science
820
, 1994, pp. 424-435
Pumping, cleaning and symbolic constraints solving
Anne-Cécile Caron
,
Hubert Comon
,
Jean-Luc Coquidé
,
Max Dauchet
,
Florent Jacquemard
Lecture Notes in Computer Science
820
, 1994, pp. 436-449
Dynamically-typed computations for order-sorted equational presentations
Claus Hintermeier
,
Claude Kirchner
,
Hélène Kirchner
Lecture Notes in Computer Science
820
, 1994, pp. 450-461
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
Roberto di Cosmo
,
Delia Kesner
Lecture Notes in Computer Science
820
, 1994, pp. 462-472
On the theory of interconnection networks for parallel computers
Eli Upfal
Lecture Notes in Computer Science
820
, 1994, pp. 473-486
Multiway cuts in directed and node weighted graphs
Naveen Garg
,
Vijay V. Vazirani
,
Mihalis Yannakakis
Lecture Notes in Computer Science
820
, 1994, pp. 487-498
A fast randomized LOGSPACE algorithm for graph connectivity
Uriel Feige
Lecture Notes in Computer Science
820
, 1994, pp. 499-507
Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
S. Nikoletseas
,
K. Palem
,
P. Spirakis
,
M. Yung
Lecture Notes in Computer Science
820
, 1994, pp. 508-519
The size of an intertwine
Jens Lagergren
Lecture Notes in Computer Science
820
, 1994, pp. 520-531
Finding even cycles even faster
Raphael Yuster
,
Uri Zwick
Lecture Notes in Computer Science
820
, 1994, pp. 532-543
Polynomial time analysis of toroidal periodic graphs
F. Höfting
,
E. Wanke
Lecture Notes in Computer Science
820
, 1994, pp. 544-555
A tight lower bound for primitivity in
k
-structures
P. Bonizzoni
Lecture Notes in Computer Science
820
, 1994, pp. 556-567
Randomness in distribution protocols
Carlo Blundo
,
Alfredo de Santis aund Ugo Vaccaro
Lecture Notes in Computer Science
820
, 1994, pp. 568-579
Lower space bounds for randomized computation
Rūsiņs̆ Freivalds
,
Marek Karpinski
Lecture Notes in Computer Science
820
, 1994, pp. 580-592
The average case complexity of the parallel prefix problem
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
,
Stephan Weis
Lecture Notes in Computer Science
820
, 1994, pp. 593-604
Prefix codes: Equiprobable words, unequal letter costs
Mordecai J. Golin
,
Neal Young
Lecture Notes in Computer Science
820
, 1994, pp. 605-617
Seiten
<
1
2
3
>