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: Author="Dang, Zhe"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sampling automata and programs
Qin Li
,
Zhe Dang
Theoretical Computer Science
577
, 2015, pp. 125-140
Information rate of some classes of non-regular languages: An automata-theoretic approach
Cewei Cui
,
Zhe Dang
,
Thomas R. Fischer
,
Oscar H. Ibarra
Lecture Notes in Computer Science
8634
, 2014, pp. 232-243
Zero-knowledge blackbox testing: Where are the faults?
Eric Wang
,
Cewei Cui
,
Zhe Dang
,
Thomas R. Fischer
,
Linmin Yang
International Journal of Foundations of Computer Science
25
(2), 2014, pp. 195-217
Similarity in languages and programs
Cewei Cui
,
Zhe Dang
,
Thomas R. Fischer
,
Oscar H. Ibarra
Theoretical Computer Science
498
, 2013, pp. 58-75
On counter machines, reachability problems, and diophantine equations
Oscar H. Ibarra
,
Zhe Dang
,
Linmin Yang
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 919-934
On stateless automata and
P
systems
Linmin Yang
,
Zhe Dang
,
Oscar H. Ibarra
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1259-1276
On the solvability of a class of diophantine equations and applications
Oscar H. Ibarra
,
Zhe Dang
Theoretical Computer Science
352
(1-3), 2006, pp. 342-346
On composition and lookahead delegation of e-services modeled by automata
Zhe Dang
,
Oscar H. Ibarra
,
Jianwen Su
Theoretical Computer Science
341
(1-3), 2005, pp. 344-363
On two-way nondeterministic finite automata with one reversal-bounded counter
Zhe Dang
,
Oscar H. Ibarra
,
Zhi-Wei Sun
Theoretical Computer Science
330
(1), 2005, pp. 59-79
On one-membrane
P
systems operating in sequential mode
Zhe Dang
,
Oscar H. Ibarra
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 867-881
On sequential and 1-deterministic
P
systems
Oscar H. Ibarra
,
Sara Woodworth
,
Hsu-Chun Yen
,
Zhe Dang
Lecture Notes in Computer Science
3595
, 2005, pp. 905-914
On various notions of parallelism in
P
systems
Oscar H. Ibarra
,
Hsu-Chun Yen
,
Zhe Dang
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 683-705
Signaling
P
systems and verification problems
Cheng Li
,
Zhe Dang
,
Oscar H. Ibarra
,
Hsu-Chun Yen
Lecture Notes in Computer Science
3580
, 2005, pp. 1462-1473
Past pushdown timed automata and safety verification
Zhe Dang
,
Tevfik Bultan
,
Oscar H. Ibarra
,
Richard A. Kemmerer
Theoretical Computer Science
313
(1), 2004, pp. 57-71
Real-counter automata and their decision problems
Zhe Dang
,
Oscar H. Ibarra
,
Pierluigi San Pietro
,
Gaoyan Xie
Lecture Notes in Computer Science
3328
, 2004, pp. 198-210
Composability of infinite-state activity automata
Zhe Dang
,
Oscar H. Ibarra
,
Jianwen Su
Lecture Notes in Computer Science
3341
, 2004, pp. 377-388
Catalytic
P
systems, semilinear sets, and vector addition systems
Oscar H. Ibarra
,
Zhe Dang
,
Omer Egecioglu
Theoretical Computer Science
312
(2-3), 2004, pp. 379-399
On two-way FA with monotonic counters and quadratic Diophantine equations
Oscar H. Ibarra
,
Zhe Dang
Theoretical Computer Science
312
(2-3), 2004, pp. 359-378
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Gaoyan Xie
,
Cheng Li
,
Zhe Dang
Theoretical Computer Science
328
(1-2), 2004, pp. 203-219
Generalized discrete timed automata: Decidable approximations for safety verification
Zhe Dang
,
Oscar H. Ibarra
,
Richard A. Kemmerer
Theoretical Computer Science
296
(1), 2003, pp. 59-74
Presburger liveness verification of discrete timed automata
Zhe Dang
,
Pierluigi San Pietro
,
Richard A. Kemmerer
Theoretical Computer Science
299
(1-3), 2003, pp. 413-438
Pushdown timed automata: A binary reachability characterization and safety verification
Zhe Dang
Theoretical Computer Science
302
(1-3), 2003, pp. 93-121
Characterizations of catalytic membrane computing systems
Oscar H. Ibarra
,
Zhe Dang
,
Omer Egecioglu
,
Gaurav Saxena
Lecture Notes in Computer Science
2747
, 2003, pp. 480-489
Verification in loosely synchronous queue-connected discrete timed automata
Oscar H. Ibarra
,
Zhe Dang
,
Pierluigi San Pietro
Theoretical Computer Science
290
(3), 2003, pp. 1713-1735
Eliminating the storage tape inreachability constructions
Oscar H. Ibarra
,
Zhe Dang
Theoretical Computer Science
299
(1-3), 2003, pp. 687-706
Seiten 1
2
>