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: Author="Yen, H.-C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integer linear programming and the analysis of some Petri net problems
H.-C. Yen
Theory of Computing Systems
32
(4), 1999, pp. 467-485
A taxonomy of fairness and temporal logic problems for Petri nets
R.R. Howell
,
L.E. Rosier
,
H.-C. Yen
Lecture Notes in Computer Science
324
, 1988, pp. 351-359
On optimal parallelization of sorting networks
E. Gannett
,
S.C. Kothari
,
H.-C. Yen
Lecture Notes in Computer Science
287
, 1987, pp. 195-206
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
R. Howell
,
D. Huynh
,
L. Rosier
,
H.-C. Yen
Technical Report (TR-86-08), 1986, March
Boundedness, empty channel detection, and synchronization for communicating finite automata
L.E. Rosier
,
H.-C. Yen
Theoretical Computer Science
44
(1), 1986, pp. 69-105
A multiparameter analysis of the boundedness problem for vector addition systems
L.E. Rosier
,
H.-C. Yen
Lecture Notes in Computer Science
199
, 1985, pp. 361-370