Andrea E. F. Clementi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast flooding over Manhattan. Distributed Computing 26(1): 25-38 (2013)
i20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
i19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri: Distributed Community Detection in Dynamic Graphs. CoRR abs/1302.5607 (2013)
2012
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59(3): 289-298 (2012)
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan: Information spreading in dynamic graphs. PODC 2012: 37-46
2011
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling mobility: A discrete revolution. Ad Hoc Networks 9(6): 998-1014 (2011)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri: Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distrib. Syst. 22(2): 208-216 (2011)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distrib. Syst. 22(9): 1425-1432 (2011)
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Riccardo Silvestri: Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC 2011: 298-310
i18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Riccardo Silvestri: Parsimonious Flooding in Geometric Random-Walks. CoRR abs/1101.5308 (2011)
i17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011)
i16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri: Information Spreading in Opportunistic Networks is Fast. CoRR abs/1107.5241 (2011)
i15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan: Information Spreading in Dynamic Graphs. CoRR abs/1111.0583 (2011)
2010
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discrete Math. 24(4): 1694-1712 (2010)
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling Mobility: A Discrete Revolution. ICALP (2) 2010: 490-501
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast flooding over Manhattan. PODC 2010: 375-383
i14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling Mobility: A Discrete Revolution. CoRR abs/1002.1016 (2010)
i13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast Flooding over Manhattan. CoRR abs/1002.3757 (2010)
2009
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009)
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri: MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) 2009: 387-398
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information spreading in stationary Markovian evolving graphs. IPDPS 2009: 1-12
i12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri: MANETS: High mobility can make up for low transmission power. CoRR abs/0903.0520 (2009)
2008
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399(1-2): 38-53 (2008)
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM 2008: 354-361
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Flooding time in edge-Markovian dynamic graphs. PODC 2008: 213-222
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. CoRR abs/0804.3902 (2008)
2007
j18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384(2-3): 161-167 (2007)
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS 2007: 430-441
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri: Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS 2007: 247-259
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri: Communication in dynamic radio networks. PODC 2007: 205-214
2006
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW 2006: 60-72
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239
2005
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1-2): 27-41 (2005)
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS 2005
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri: Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO 2005: 89-98
2004
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput. 64(1): 89-96 (2004)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: On the Power Assignment Problem in Radio Networks. MONET 9(2): 125-140 (2004)
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri: The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS 2004
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri: Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS 2004: 418-427
2003
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri: The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2): 95-110 (2003)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 1-3(299): 751-761 (2003)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1-3): 337-364 (2003)
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna: On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS 2003: 222
c27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO 2003: 1-16
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251
2002
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC 2002: 320-331
2001
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA 2001: 452-463
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Distributed multi-broadcast in unknown radio networks. PODC 2001: 255-264
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri: On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA 2001: 709-718
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Distributed Broadcast in Wireless Networks with Unknown Topology. CoRR cs.DS/0107011 (2001)
2000
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri: The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154
c18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna: A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops 2000: 123-134
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Parallel Read Operations Without Memory Contention. Electronic Colloquium on Computational Complexity (ECCC) 7(53) (2000)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (ECCC) 7(54) (2000)
1999
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. 28(6): 2103-2116 (1999)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. Theor. Comput. Sci. 221(1-2): 3-18 (1999)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Luca Trevisan: Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. Theor. Comput. Sci. 225(1-2): 113-128 (1999)
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi: On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP 1999: 179-189
c14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX 1999: 197-208
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS 1999: 68-77
1998
j8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Recent Advances Towards Proving P = BPP. Bulletin of the EATCS 64 (1998)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: A New General Derandomization Method. J. ACM 45(1): 179-213 (1998)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998)
1997
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Theor. Comput. Sci. 180(1-2): 243-268 (1997)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. ICALP 1997: 177-187
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS 1997: 387-398
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. Electronic Colloquium on Computational Complexity (ECCC) 4(11) (1997)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 4(53) (1997)
1996
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theor. Comput. Sci. 161(1&2): 307-314 (1996)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni: On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Netw. 4(2): 272-280 (1996)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON 1996: 333-342
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. ICALP 1996: 357-368
c7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS 1996: 155-161
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri: Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, José D. P. Rolim, Erik Urland: Randomized parallel algorithms. Solving Combinatorial Optimization Problems in Parallel 1996: 25-50
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. STACS 1996: 319-330
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints. Electronic Colloquium on Computational Complexity (ECCC) 3(16) (1996)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Towards efficient constructions of hitting sets that derandomize BPP. Electronic Colloquium on Computational Complexity (ECCC) 3(29) (1996)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Properties of Hard Boolean Operators and their Consequences on BPP. Electronic Colloquium on Computational Complexity (ECCC) 3(55) (1996)
1995
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6(2): 155-168 (1995)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Russell Impagliazzo: The Reachability Problem for Finite Cellular Automata. Inf. Process. Lett. 53(1): 27-31 (1995)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Electronic Colloquium on Computational Complexity (ECCC) 2(41) (1995)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. Electronic Colloquium on Computational Complexity (ECCC) 2(61) (1995)
1994
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Russell Impagliazzo: Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. CIAC 1994: 73-90
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. INFOCOM 1994: 1336-1343

Coauthor Index

1Sergio De Agostino
[j6] [c3]
2Christoph Ambühl
[j17] [c30] [c29] [c27] [c26]
3Alexander E. Andreev
[i9] [j11] [j10] [c15] [c13] [j7] [j6] [j5] [c12] [c11] [c10] [i7] [i6] [j4] [c8] [c7] [c4] [i4] [i3] [c3] [i2] [i1]
4Juri L. Baskakov
[c15] [i6]
5Luca Becchetti
[i16]
6Gian Carlo Bongiovanni
[c18]
7Daniel P. Bovet
[c6]
8Tiziana Calamoneri
[j23] [j19] [c39] [i11] [c36] [c33]
9Pierluigi Crescenzi (Pilu Crescenzi)
[i20] [c22] [c20] [c16] [j6] [c6] [c3]
10Elias Dahlhaus
[j6] [c3]
11Carola Doerr (Carola Winzen)
[i20]
12Afonso Ferreira
[j14] [c19]
13Pierre Fraigniaud
[i20]
14Emanuele G. Fusco
[j23] [c36]
15Giorgio Gambosi
[i19]
16Gurvan Huiban
[c28]
17Miriam Di Ianni
[i19] [j19] [j18] [c34] [c33] [c32] [c31] [c30] [c29] [j13] [j3] [j2] [c1]
18Russell Impagliazzo
[j1] [c2]
19Marco Isopi
[i20]
20Massimo Lauria
[j19] [j18] [c34] [c33] [c31]
21Nissan Lev-Tov (Nissan Law-yone)
[c29]
22Claudio Macci
[j21] [c38]
23Angelo Monti
[j26] [j25] [j24] [j22] [i17] [j21] [c43] [c42] [i14] [i13] [j20] [c40] [j19] [c39] [c38] [i11] [j18] [c37] [c35] [c34] [c33] [c32] [c31] [j16] [c30] [c29] [j12] [c25] [c24] [c23] [c22] [c21] [i10]
24Emanuele Natale
[i19]
25Alessandro Panconesi
[i20]
26Francesco Pasquale
[i20] [j25] [j22] [i17] [i16] [j21] [j20] [c41] [c40] [i12] [c38] [c37] [c35]
27David Peleg
[c29]
28Paolo Penna
[j17] [j15] [j14] [c28] [c27] [c26] [c22] [c20] [c19] [c18] [c17] [i9] [i8] [c14] [c13]
29Stéphane Pérennes (Stephane Perennes)
[j14] [c19]
30Giovanni Resta
[i16]
31José D. P. Rolim
[i9] [j11] [j10] [c15] [c13] [j8] [j7] [j6] [j5] [c12] [c11] [c10] [i7] [i6] [j4] [c8] [c7] [c5] [c4] [i4] [i3] [c3] [i2] [i1]
32Gianluca Rossi
[c39] [i11] [j18] [c34] [j17] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c20] [c16]
33Paolo Santi
[i16]
34Riccardo Silvestri
[j26] [i20] [i19] [j25] [c45] [j24] [j23] [j22] [c44] [i18] [i17] [i16] [i15] [j21] [c43] [c42] [i14] [i13] [j20] [c41] [c40] [i12] [j19] [c39] [c38] [i11] [j18] [c37] [c36] [c35] [c34] [c33] [j17] [c32] [c31] [j16] [j15] [c30] [c29] [j14] [j13] [j12] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [i10] [c19] [c17] [i8] [c14] [c6]
35Luca Trevisan
[c45] [i15] [j11] [j9] [j8] [c12] [i7] [c9] [i5]
36Erik Urland
[c5]
37Yann C. Verhoeven
[c28]
38Paola Vocca
[c20]
Last update Sat May 25 03:25:05 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page