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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Prefix codes: Equiprobable words, unequal letter costs
Mordecai J. Golin
,
Neal Young
Lecture Notes in Computer Science
820
, 1994, pp. 605-617
CoReA: A synchronous calculus of parallel communicating reactive automata
Frédéric Boniol
Lecture Notes in Computer Science
817
, 1994, pp. 611-622
Automatic verification of finite-state concurrent systems
Edmund M. Clarke
Lecture Notes in Computer Science
815
, 1994, pp. 1
The application of Petri nets to the modeling, analysis and control of intelligent urban traffic networks
Frank DiCesare
,
Paul T. Kulp
,
Michael Gile
,
George List
Lecture Notes in Computer Science
815
, 1994, pp. 2-15
B-W analysis: A backward reachability analysis for diagnostic problem solving suitable to parallel implementation
Cosimo Anglano
,
Luigi Portinale
Lecture Notes in Computer Science
815
, 1994, pp. 39-58
Probabilistic validation of a remote procedure call protocol
N. Bennacer
,
G. Florin
,
C. Fraize
,
S. Natkin
Lecture Notes in Computer Science
815
, 1994, pp. 59-78
Occurrence graphs for interval timed coloured nets
Gérard Berthelot
,
Hanifa Boucheneb
Lecture Notes in Computer Science
815
, 1994, pp. 79-98
Implementation of weighted place/transition nets based on linear enabling functions
J.L. Briz
,
J.M. Colom
Lecture Notes in Computer Science
815
, 1994, pp. 99-118
Hierarchical high level Petri nets for complex system analysis
Peter Buchholz
Lecture Notes in Computer Science
815
, 1994, pp. 119-138
Modeling symmetric computer architectures by SWNs
G. Chiola
,
G. Franceschinis
,
R. Gaeta
Lecture Notes in Computer Science
815
, 1994, pp. 139-158
Coloured Petri nets extended with channels for synchronous communication
Soren Christensen
,
Niels Damgaard Hansen
Lecture Notes in Computer Science
815
, 1994, pp. 159-178
Petri nets with marking-dependet arc cardinality: Properties and analysis
Gianfranco Ciardo
Lecture Notes in Computer Science
815
, 1994, pp. 179-198
New structural invariant for Petri nets analysis
J.M. Couvreur
,
E. Paviot-Adet
Lecture Notes in Computer Science
815
, 1994, pp. 199-218
Timed stream Petri nets: A model for timed multimedia information
Michel Diaz
,
Patrick Sénac
Lecture Notes in Computer Science
815
, 1994, pp. 219-238
A term representation of P/T systems
Cheryl Dietz
,
Gerlinde Schreiber
Lecture Notes in Computer Science
815
, 1994, pp. 239-257
Superposed generalized stochastic Petri nets: Definition and efficient solution
Susanna Donatelli
Lecture Notes in Computer Science
815
, 1994, pp. 258-277
Verification of recipe-based control procedures by means of predicate/transition nets
Hartmann J. Genrich
,
Hans-Michael Hanisch
,
Konrad Wöllhaf
Lecture Notes in Computer Science
815
, 1994, pp. 278-297
A space efficient algorithm for finding the best non-overlapping alignment score
Gary Benson
Lecture Notes in Computer Science
807
, 1994, pp. 1-14
The parameterized complexity of sequence alignment and consensus
Hans Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Harold T. Wareham
Lecture Notes in Computer Science
807
, 1994, pp. 15-30
Computing all suboptimal alignments in linear space
Kun-Mao Chao
Lecture Notes in Computer Science
807
, 1994, pp. 31-42
Approximation algorithms for multiple sequence alignment
Vineet Bafna
,
Eugene L. Lawler
,
Pavel A. Pevzner
Lecture Notes in Computer Science
807
, 1994, pp. 43-53
A context dependent method for comparing sequences
Xiaoqiu Huang
Lecture Notes in Computer Science
807
, 1994, pp. 54-63
Fast identification of approximately matching substrings
Archie L. Cobbs
Lecture Notes in Computer Science
807
, 1994, pp. 64-74
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>