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="Dunne, Paul E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of deciding reachability properties of distributed negotiation schemes
Paul E. Dunne
,
Yann Chevaleyre
Theoretical Computer Science
396
(1-3), 2008, pp. 113-144
Complexity-theoretic models of phase transitions in search problems
Paul E. Dunne
,
Alan Gibbons
,
Michele Zito
Theoretical Computer Science
249
(2), 2000, pp. 243-263
An improved upper bound on the non-3-colourability threshold
Paul E. Dunne
,
Michele Zito
Information Processing Letters
65
(1), 1998, pp. 17-23
Multiprocessor simulation strategies with optimal speed-up
Paul E. Dunne
,
Chris J. Gittings
,
Paul H. Leng
Information Processing Letters
54
, 1995, pp. 23-33
On the complexity of boolean functions computed by lazy oracles
Paul E. Dunne
,
Paul H. Leng
,
Gerald F. Nwana
IEEE Transactions on Computers
44
(4), 1995, pp. 495-502
Relationships between monotone and non-monotone network complexity
Paul E. Dunne
Boolean function complexity
London Mathematical Society Lecture Note Series 169
, 1992, pp. 1-24
Comment on Kochol's paper ``efficient monotone circuits for threshold functions''
Paul E. Dunne
Information Processing Letters
34
, 1990, pp. 221-222
On monotone simulations of nonmonotone networks
Paul E. Dunne
Theoretical Computer Science
66
, 1989, pp. 15-25