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="Crescenzi, Pierluigi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
Michele Borassi
,
Pierluigi Crescenzi
,
Michel Habib
,
Walter A. Kosters
,
Andrea Marino
,
Frank W. Takes
Theoretical Computer Science
586
, 2015, pp. 59-80
Flooding in dynamic graphs with arbitrary degree sequence
Hervé Baumann
,
Pierluigi Crescenzi
,
Pierre Fraigniaud
Journal Parallel Distributed Computing
74
(5), 2014, pp. 2433-2437
Rumor spreading in random evolving graphs
Andrea Clementi
,
Pierluigi Crescenzi
,
Carola Doerr
,
Pierre Fraigniaud
,
Marco Isopi
,
Alessandro Panconesi
,
Francesco Pasquale
,
Riccardo Silvestri
Lecture Notes in Computer Science
8125
, 2013, pp. 325-336
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Vicente Acuña
,
Etienne Birmelé
,
Ludovic Cottret
,
Pierluigi Crescenzi
,
Fabien Jourdan
,
Vincent Lacroix
,
Alberto Marchetti-Spaccamela
,
Andrea Marino
,
Paulo Vieira Milreu
,
Marie-France Sagot
,
Leen Stougie
Theoretical Computer Science
457
, 2012, pp. 1-9
Finding the diameter in real-world graphs: Experimentally turning a lower bound into an upper bound
Pierluigi Crescenzi
,
Roberto Grossi
,
Claudio Imbrenda
,
Leonardo Lanzi
,
Andrea Marino
Lecture Notes in Computer Science
6346
, 2010, pp. 302-313
On weighted vs unweighted versions of combinatorial optimization problems
Pierluigi Crescenzi
,
Riccardo Silvestri
,
Luca Trevisan
Information and Computation
167
(1), 2001, pp. 10-26
On the complexity of approximating colored-graph problems
Andrea E.F. Clementi
,
Pierluigi Crescenzi
,
Gianluca Rossi
Lecture Notes in Computer Science
1627
, 1999, pp. 281-290
IP address lookup made fast and simple
Pierluigi Crescenzi
,
Leandro Dardini
,
Roberto Grossi
Lecture Notes in Computer Science
1643
, 1999, pp. 65-76
Structure in approximation classes
Pierluigi Crescenzi
,
Viggo Kann
,
Riccardo Silvestri
,
Luca Trevisan
SIAM Journal on Computing
28
(5), 1999, pp. 1759-1782
Max
NP
-completeness made easy
Pierluigi Crescenzi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 65-79
On the complexity of protein folding
Pierluigi Crescenzi
,
Deborah Goldman
,
Christos Papadimitriou
,
Antonio Piccolboni
,
Mihalis Yannakakis
Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, RECOMB'98 (New York, New York, March 22-25, 1998)
, 1998, pp. 61-62
On the complexity of protein folding
Pierluigi Crescenzi
,
Deborah Goldman
,
Christos Papadimitriou
,
Antonio Piccolboni
,
Mihalis Yannakakis
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 597-603
A short guide to approximation preserving reductions
Pierluigi Crescenzi
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 262-273
To weight or not to weight: Where is the question?
Pierluigi Crescenzi
,
Riccardo Silvestri
,
Luca Trevisan
Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, ISTCS'96 (Jerusalem, Israel, June 10-12, 1996)
, 1996, pp. 68-77
MAX SAT and MIN SET cover approximation algorithms are
P
-complete
Giancarlo Bongiovanni
,
Pierluigi Crescenzi
,
Sergio De Agostino
Parallel Processing Letters
5
(2), 1995, pp. 293-298
Complexity classes and sparse oracles
Daniel P. Bovet
,
Pierluigi Crescenzi
,
Riccardo Silvestri
Journal of Computer and System Sciences
50
(3), 1995, pp. 382-390
Reversible simulation of space-bounded computations
Pierluigi Crescenzi
,
Christos H. Papadimitriou
Theoretical Computer Science
143
(1), 1995, pp. 159-165
Minimum vertex cover, distributed decision-making, and communication complexity
Pierluigi Crescenzi
,
Luca Trevisan
Lecture Notes in Computer Science
903
, 1995, pp. 130-139
Introduction to the theory of complexity
Daniel Pierre Bovet
,
Pierluigi Crescenzi
Prentice Hall Series in Computer Science
, 1994, pp. xi,282
On approximation scheme preserving reducibility and its applications
Pierluigi Crescenzi
,
Luca Trevisan
Lecture Notes in Computer Science
880
, 1994, pp. 330-341
Average measure, descriptive complexity and approximation of maximization problems
Pierluigi Crescenzi
,
Riccardo Silvestri
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 15-30
A note on the descriptive complexity of maximization problem
Pierluigi Crescenzi
,
Riccardo Silvestri
Information Processing Letters
47
(1), 1993, pp. 11-15
A uniform approach to define complexity classes
Daniel P. Bovet
,
Pierluigi Crescenzi
,
Riccardo Silvestri
Theoretical Computer Science
104
, 1992, pp. 263-283
Minimum-delay schedules in layered networks
Daniel P. Bovet
,
Pierluigi Crescenzi
Acta Informatica
28
, 1991, pp. 453-461
Completeness in approximation classes
Pierluigi Crescenzi
,
Alessandro Panconesi
Information and Computation
93
(2), 1991, August, pp. 241-262
Seiten 1
2
>