Search the dblp DataBase
Angelo Monti :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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. [Citation Graph (0, 0)][DBLP ] ADHOC-NOW, 2006, pp:60-72 [Conf ] Angelo Monti , Alessandro Roncato On the Complexity of Some Reachability Problems. [Citation Graph (0, 0)][DBLP ] CIAC, 1994, pp:192-202 [Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:452-463 [Conf ] Emanuela Fachini , Angelo Monti , Margherita Napoli , Domenico Parente Systolic Y-Tree Automata: Closure Properties and Decision Problems. [Citation Graph (0, 0)][DBLP ] FCT, 1991, pp:210-219 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IPDPS, 2005, pp:- [Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:320-331 [Conf ] Jozef Gruska , Angelo Monti , Margherita Napoli , Domenico Parente State Complexity of SBTA Languages. [Citation Graph (0, 0)][DBLP ] LATIN, 1995, pp:346-357 [Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Distributed multi-broadcast in unknown radio networks. [Citation Graph (0, 0)][DBLP ] PODC, 2001, pp:255-264 [Conf ] Andrea E. F. Clementi , Pierluigi Crescenzi , Angelo Monti , Paolo Penna , Riccardo Silvestri On Computing Ad-hoc Selective Families. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 2001, pp:211-222 [Conf ] Paolo Ferragina , Angelo Monti , Alessandro Roncato Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1994, pp:35-48 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2006, pp:227-239 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2005, pp:89-98 [Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Selective families, superimposed codes, and broadcasting on unknown radio networks. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:709-718 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:418-427 [Conf ] Angelo Monti , Adriano Peron Systolic Tree Omega-Languages. [Citation Graph (0, 0)][DBLP ] STACS, 1995, pp:131-142 [Conf ] Angelo Monti , Adriano Peron A Logical Characterization of Systolic Languages. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:466-476 [Conf ] Vincenzo Auletta , Angelo Monti , Domenico Parente , Giuseppe Persiano A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:259-270 [Conf ] Roberto De Prisco , Angelo Monti On Reconfigurability of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP ] WADS, 1993, pp:553-564 [Conf ] Emanuela Fachini , Angelo Monti , Margherita Napoli , Domenico Parente Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1992, v:29, n:8, pp:761-778 [Journal ] Angelo Monti , Adriano Peron Logical definability of Y-tree and trellis systolic omega-languages. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 2001, v:15, n:1, pp:75-100 [Journal ] Vincenzo Auletta , Angelo Monti , Mimmo Parente , Pino Persiano A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1999, v:23, n:3, pp:223-245 [Journal ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Distributed Broadcast in Wireless Networks with Unknown Topology [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Noga Alon , János Körner , Angelo Monti String Quartets In Binary. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal ] Emanuela Fachini , Angelo Monti Chomsky Hierarchy and Systolic Y-Tree Automata. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1997, v:29, n:4, pp:325-339 [Journal ] Angelo Monti , Domenico Parente Systolic Tree with Base Automata. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1991, v:2, n:3, pp:221-236 [Journal ] Angelo Monti On the Computational Complexity of Graph Closures. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:57, n:6, pp:291-295 [Journal ] Angelo Monti , Alessandro Roncato Completeness Results Concerning Systolic Tree Automata and EOL Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:53, n:1, pp:11-16 [Journal ] Angelo Monti , Alessandro Roncato A Gap Theorem for the Anonymous Torus. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:57, n:5, pp:279-285 [Journal ] Emanuela Fachini , Angelo Monti A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:49, n:1, pp:133-147 [Journal ] Emanuela Fachini , János Körner , Angelo Monti A Better Bound for Locally Thin Set Families. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:209-218 [Journal ] János Körner , Angelo Monti Delta-Systems and Qualitative (In)Dependence. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2002, v:99, n:1, pp:75-84 [Journal ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Round Robin is optimal for fault-tolerant broadcasting on wireless networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:89-96 [Journal ] János Körner , Angelo Monti Compact Representations of the Intersection Structure of Families of Finite Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:2, pp:181-192 [Journal ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Distributed broadcast in radio networks of unknown topology. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:302, n:1-3, pp:337-364 [Journal ] Jozef Gruska , Angelo Monti , Margherita Napoli , Domenico Parente Succinctness of Descriptions of SBTA-Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:179, n:1-2, pp:251-271 [Journal ] Angelo Monti , Adriano Peron Systolic tree omega-Languages: the operational and the logical view. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:233, n:1-2, pp:1-18 [Journal ] Roberto De Prisco , Angelo Monti , Linda Pagli Testing and Reconfiguration of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:171-188 [Journal ] Andrea E. F. Clementi , Angelo Monti , Francesco Pasquale , Riccardo Silvestri Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:430-441 [Conf ] Andrea E. F. Clementi , Francesco Pasquale , Angelo Monti , Riccardo Silvestri Communication in dynamic radio networks. [Citation Graph (0, 0)][DBLP ] PODC, 2007, pp:205-214 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:384, n:2-3, pp:161-167 [Journal ] Modelling Mobility: A Discrete Revolution. [Citation Graph (, )][DBLP ] Information spreading in stationary Markovian evolving graphs. [Citation Graph (, )][DBLP ] Spanning Trees with Many Leaves in Regular Bipartite Graphs. [Citation Graph (, )][DBLP ] Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. [Citation Graph (, )][DBLP ] Flooding time in edge-Markovian dynamic graphs. [Citation Graph (, )][DBLP ] Fast flooding over Manhattan. [Citation Graph (, )][DBLP ] An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. [Citation Graph (, )][DBLP ] Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms [Citation Graph (, )][DBLP ] Modelling Mobility: A Discrete Revolution [Citation Graph (, )][DBLP ] Fast Flooding over Manhattan [Citation Graph (, )][DBLP ] Search in 0.033secs, Finished in 0.035secs