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=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compositional liveness properties of EN-systems
D. Gomm
,
E. Kindler
,
B. Paech
,
R. Walter
Lecture Notes in Computer Science
691
, 1993, pp. 262-281
Analysis of place/transition nets with timed arcs and its application to batch process control
Hans-Michael Hanisch
Lecture Notes in Computer Science
691
, 1993, pp. 282-299
On well-formed nets and optimizations in enabling tests
Jean-Michel IliƩ
,
Omar Rojas
Lecture Notes in Computer Science
691
, 1993, pp. 300-318
Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net
Peter Kemper
Lecture Notes in Computer Science
691
, 1993, pp. 319-338
A colored Petri net model for a naval command and control system
J. Berger
,
L. Lamontagne
Lecture Notes in Computer Science
691
, 1993, pp. 532-541
Petri net based specifications of services in an intelligent network - experiences gained from a test case application
Carla Capellmann
,
Heinz Dibold
Lecture Notes in Computer Science
691
, 1993, pp. 542-551
On net modeling of industrial size concurrent systems
Ludmila Cherkasova
,
Vadim Kotov
,
Thomas Rokicki
Lecture Notes in Computer Science
691
, 1993, pp. 552-561
Analysis of the TMS320C40 communication channels using timed Petri nets
David A. Hartley
,
David M. Harvey
Lecture Notes in Computer Science
691
, 1993, pp. 562-571
Protocol optimization for a packet-switched bus in case of burst traffic by means of GSPN
Guenter Klas
Lecture Notes in Computer Science
691
, 1993, pp. 572-581
A linear time pattern matching algorithm between a string and a tree
Tatsuya Akutsu
Lecture Notes in Computer Science
684
, 1993, pp. 1-10
Tight comparison bounds for the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Lecture Notes in Computer Science
684
, 1993, pp. 11-19
3-D docking of protein molecules
Daniel Fischer
,
Raquel Norel
,
Ruth Nussinov
,
Haim J. Wolfson
Lecture Notes in Computer Science
684
, 1993, pp. 20-34
Minimal separators of two words
Emmanuelle Garel
Lecture Notes in Computer Science
684
, 1993, pp. 35-53
Covering a string
Costas S. Iliopoulos
,
Dennis W.G. Moore
,
Kunsoo Park
Lecture Notes in Computer Science
684
, 1993, pp. 54-62
On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of
k
strings
Robert W. Irving
,
Campbell B. Fraser
Lecture Notes in Computer Science
684
, 1993, pp. 63-73
An algorithm for locating non-overlapping regions of maximum alignment score
Sampath K. Kannan
,
Eugene W. Myers
Lecture Notes in Computer Science
684
, 1993, pp. 74-86
Exact and approximation algorithms for the inversion distance between two chromosomes
John Kececioglu
,
David Sankoff
Lecture Notes in Computer Science
684
, 1993, pp. 87-105
The maximum weight trace problem in multiple sequence alignment
John Kececioglu
Lecture Notes in Computer Science
684
, 1993, pp. 106-119
An algorithm for approximate tandem repeats
Gad M. Landau
,
Jeanette P. Schmidt
Lecture Notes in Computer Science
684
, 1993, pp. 120-133
Two dimensional pattern matching in a digitized image
Gad M. Landau
,
Uzi Vishkin
Lecture Notes in Computer Science
684
, 1993, pp. 134-151
Relations between models of parallel abstract machines
Michel Cosnard
,
Pascal Koiran
Lecture Notes in Computer Science
678
, 1993, pp. 37-46
Cost effectiveness of data flow machines and vector processors
Arno Formella
,
Werner Massonne
,
Wolfgang J. Paul
Lecture Notes in Computer Science
678
, 1993, pp. 48-65
The networks of the Connection Machine CM-5
Charles E. Leiserson
Lecture Notes in Computer Science
678
, 1993, pp. 66-67
Massively parallel computing: Data distribution and communication
S. Lennart Johnsson
Lecture Notes in Computer Science
678
, 1993, pp. 68-92
Programmable active memories: A performance assessment
Patrice Bertin
,
Didier Roncin
,
Jean Vuillemin
Lecture Notes in Computer Science
678
, 1993, pp. 119-130
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>