| 2008 |
|---|
| 173 | EE | Eduardo Mesa Barrameda,
Shantanu Das,
Nicola Santoro:
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments.
ALGOSENSORS 2008: 125-140 |
| 172 | EE | Paola Flocchini,
David Ilcinkas,
Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.
DISC 2008: 227-241 |
| 171 | EE | Xu Li,
Nicola Santoro,
Ivan Stojmenovic:
Localized distance-sensitive service discovery in wireless sensor networks.
FOWANC 2008: 85-92 |
| 170 | EE | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Tree Decontamination with Temporary Immunity.
ISAAC 2008: 330-341 |
| 169 | EE | Nicola Santoro:
Mobile Entities Computing: Models and Problems.
SIROCCO 2008: 1 |
| 168 | EE | Paola Flocchini,
David Ilcinkas,
Andrzej Pelc,
Nicola Santoro:
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.
SIROCCO 2008: 33-47 |
| 167 | EE | Stefan Dobrev,
Nicola Santoro,
Wei Shi:
Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens.
Int. J. Found. Comput. Sci. 19(6): 1355-1372 (2008) |
| 166 | EE | Paola Flocchini,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Computing all the best swap edges distributively.
J. Parallel Distrib. Comput. 68(7): 976-983 (2008) |
| 165 | EE | Stefan Dobrev,
Rastislav Kralovic,
Richard Královic,
Nicola Santoro:
On fractional dynamic faults with thresholds.
Theor. Comput. Sci. 399(1-2): 101-117 (2008) |
| 164 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Self-deployment of mobile sensors on a ring.
Theor. Comput. Sci. 402(1): 67-80 (2008) |
| 163 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.
Theor. Comput. Sci. 407(1-3): 412-447 (2008) |
| 2007 |
|---|
| 162 | EE | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.
DISC 2007: 108-122 |
| 161 | EE | Beat Gfeller,
Nicola Santoro,
Peter Widmayer:
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
DISC 2007: 268-282 |
| 160 | EE | Paola Flocchini,
Toni Mesa Enriquez,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro:
Distributed Computation of All Node Replacements of a Minimum Spanning Tree.
Euro-Par 2007: 598-607 |
| 159 | EE | Stefan Dobrev,
Nicola Santoro,
Wei Shi:
Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents.
Euro-Par 2007: 608-617 |
| 158 | EE | Nicola Santoro:
Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs.
FUN 2007: 14 |
| 157 | EE | Stefan Dobrev,
Nicola Santoro,
Wei Shi:
Scattered Black Hole Search in an Oriented Ring using Tokens.
IPDPS 2007: 1-8 |
| 156 | EE | Paola Flocchini,
David Ilcinkas,
Andrzej Pelc,
Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
OPODIS 2007: 105-118 |
| 155 | EE | Shantanu Das,
Paola Flocchini,
Nicola Santoro,
Masafumi Yamashita:
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.
SIROCCO 2007: 289-303 |
| 154 | EE | Xu Li,
Nicola Santoro,
Ivan Stojmenovic:
Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks.
UIC 2007: 696-708 |
| 153 | EE | Stefan Dobrev,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Mobile Search for a Black Hole in an Anonymous Ring.
Algorithmica 48(1): 67-90 (2007) |
| 152 | EE | Michael H. Albert,
Mike D. Atkinson,
Doron Nussbaum,
Jörg-Rüdiger Sack,
Nicola Santoro:
On the longest increasing subsequence of a circular list.
Inf. Process. Lett. 101(2): 55-59 (2007) |
| 151 | EE | Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Network decontamination in Presence of Local Immunity.
Int. J. Found. Comput. Sci. 18(3): 457-474 (2007) |
| 150 | EE | Nicola Santoro,
Peter Widmayer:
Agreement in synchronous networks with ubiquitous faults.
Theor. Comput. Sci. 384(2-3): 232-249 (2007) |
| 149 | EE | Shantanu Das,
Paola Flocchini,
Shay Kutten,
Amiya Nayak,
Nicola Santoro:
Map construction of unknown graphs by multiple agents.
Theor. Comput. Sci. 385(1-3): 34-48 (2007) |
| 148 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.
Theory Comput. Syst. 40(2): 143-162 (2007) |
| 2006 |
|---|
| 147 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Self-deployment Algorithms for Mobile Sensors on a Ring.
ALGOSENSORS 2006: 59-70 |
| 146 | EE | Stefan Dobrev,
Rastislav Kralovic,
Nicola Santoro,
Wei Shi:
Black Hole Search in Asynchronous Rings Using Tokens.
CIAC 2006: 139-150 |
| 145 | EE | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Groupings and Pairings in Anonymous Networks.
DISC 2006: 105-119 |
| 144 | EE | Paola Flocchini,
Nicola Santoro:
Distributed Security Algorithms by Mobile Agents.
ICDCN 2006: 1-14 |
| 143 | EE | Stefan Dobrev,
Paola Flocchini,
Nicola Santoro:
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search.
ICDCS 2006: 57 |
| 142 | EE | Nicola Santoro:
Distributed Algorithms for Autonomous Mobile Robots.
IFIP TCS 2006: 11 |
| 141 | EE | Stefan Dobrev,
Paola Flocchini,
Rastislav Kralovic,
Nicola Santoro:
Exploring an Unknown Graph to Locate a Black Hole Using Tokens.
IFIP TCS 2006: 131-150 |
| 140 | EE | Giuseppe Prencipe,
Nicola Santoro:
Distributed Algorithms for Autonomous Mobile Robots.
IFIP TCS 2006: 47-62 |
| 139 | EE | Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Network decontamination with local immunization.
IPDPS 2006 |
| 138 | EE | Shantanu Das,
Paola Flocchini,
Amiya Nayak,
Nicola Santoro:
Effective Elections for Anonymous Mobile Agents.
ISAAC 2006: 732-743 |
| 137 | EE | Xu Li,
Nicola Santoro:
ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks.
LCN 2006: 923-930 |
| 136 | EE | Xu Li,
Nicola Santoro:
An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks.
MSN 2006: 847-860 |
| 135 | EE | A. Mawlood-Yunis,
M. Weiss,
Nicola Santoro:
Issues for Robust Consensus Building in P2P Networks.
OTM Workshops (2) 2006: 1021-1027 |
| 134 | | George Coucopoulos,
Nishith Goel,
Amiya Nayak,
Nicola Santoro:
Order and Balance in Continuously-Fault-Tolerant Distributions of Objects.
Parallel and Distributed Computing and Networks 2006: 198-203 |
| 133 | EE | Stefan Dobrev,
Rastislav Kralovic,
Richard Královic,
Nicola Santoro:
On Fractional Dynamic Faults with Threshold.
SIROCCO 2006: 197-211 |
| 132 | EE | Stefan Dobrev,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Searching for a black hole in arbitrary networks: optimal mobile agents protocols.
Distributed Computing 19(1): 1-99999 (2006) |
| 131 | EE | Paola Flocchini,
Antonio Mesa Enriques,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro:
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.
IEICE Transactions 89-D(2): 700-708 (2006) |
| 130 | EE | Stefan Dobrev,
Paola Flocchini,
Rastislav Kralovic,
Peter Ruzicka,
Giuseppe Prencipe,
Nicola Santoro:
Black hole search in common interconnection networks.
Networks 47(2): 61-71 (2006) |
| 2005 |
|---|
| 129 | EE | Nicola Santoro:
Mobile Agents Computing: Security Issues and Algorithmic Solutions.
ICTCS 2005: 22 |
| 128 | EE | Nicola Santoro,
Peter Widmayer:
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults.
SIROCCO 2005: 262-276 |
| 127 | EE | Shantanu Das,
Paola Flocchini,
Amiya Nayak,
Nicola Santoro:
Distributed Exploration of an Unknown Graph.
SIROCCO 2005: 99-114 |
| 126 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Gathering of asynchronous robots with limited visibility.
Theor. Comput. Sci. 337(1-3): 147-168 (2005) |
| 2004 |
|---|
| 125 | EE | A. Mawlood-Yunis,
Amiya Nayak,
Doron Nussbaum,
Nicola Santoro:
Comparing Performance of Two Mobile Agent Platforms in Distributed Search.
IAT 2004: 425-428 |
| 124 | | Paola Flocchini,
Antonio Mesa Enriques,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro:
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.
IFIP TCS 2004: 153-166 |
| 123 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro,
Cindy Sawchuk:
Multiple Mobile Agent Rendezvous in a Ring.
LATIN 2004: 599-608 |
| 122 | EE | A. Mawlood-Yunis,
Amiya Nayak,
Doron Nussbaum,
Nicola Santoro:
On the Performance of Distributed Search by Mobile Agents.
MATA 2004: 285-294 |
| 121 | EE | Paola Flocchini,
Linda Pagli,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer,
Tranos Zuva:
Computing All the Best Swap Edges Distributively.
OPODIS 2004: 154-168 |
| 120 | EE | Stefan Dobrev,
Paola Flocchini,
Nicola Santoro:
Improved Bounds for Optimal Black Hole Search with a Network Map.
SIROCCO 2004: 111-122 |
| 119 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio,
Nicola Santoro,
Cindy Sawchuk:
Mobile Agents Rendezvous When Tokens Fail.
SIROCCO 2004: 161-172 |
| 118 | EE | Paola Flocchini,
Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Dynamic monopolies in tori.
Discrete Applied Mathematics 137(2): 197-212 (2004) |
| 117 | EE | Elena Lodi,
Linda Pagli,
Nicola Santoro:
Fun with algorithms.
Discrete Applied Mathematics 144(3): 229-230 (2004) |
| 116 | EE | Paola Flocchini,
Evangelos Kranakis,
Danny Krizanc,
Flaminia L. Luccio,
Nicola Santoro:
Sorting and election in anonymous asynchronous rings.
J. Parallel Distrib. Comput. 64(2): 254-265 (2004) |
| 2003 |
|---|
| 115 | EE | Mark Cieliebak,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Solving the Robots Gathering Problem.
ICALP 2003: 1181-1196 |
| 114 | EE | Evangelos Kranakis,
Nicola Santoro,
Cindy Sawchuk,
Danny Krizanc:
Mobile Agent Rendezvous in a Ring.
ICDCS 2003: 592-599 |
| 113 | EE | Stefan Dobrev,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Multiple Agents RendezVous in a Ring in Spite of a Black Hole.
OPODIS 2003: 34-46 |
| 112 | | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
SIROCCO 2003: 17-32 |
| 111 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Can we elect if we cannot compare?
SPAA 2003: 324-332 |
| 110 | EE | Lali Barrière,
Pierre Fraigniaud,
Nicola Santoro,
Dimitrios M. Thilikos:
Searching Is Not Jumping.
WG 2003: 34-45 |
| 109 | EE | Una-May O'Reilly,
Nicola Santoro:
Tight Bounds for Synchronous Communication of Information Using Bits, Silence.
Discrete Applied Mathematics 129(1): 195-209 (2003) |
| 108 | EE | Paola Flocchini,
Rastislav Kralovic,
Peter Ruzicka,
Alessandro Roncato,
Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies.
J. Discrete Algorithms 1(2): 129-150 (2003) |
| 107 | EE | Paola Flocchini,
Alessandro Roncato,
Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems.
SIAM J. Comput. 32(2): 281-306 (2003) |
| 106 | EE | Paola Flocchini,
Alessandro Roncato,
Nicola Santoro:
Computing on anonymous networks with sense of direction.
Theor. Comput. Sci. 1-3(301): 355-379 (2003) |
| 105 | | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Sense of direction in distributed computing.
Theor. Comput. Sci. 291(1): 29-53 (2003) |
| 2002 |
|---|
| 104 | | Ricardo A. Baeza-Yates,
Ugo Montanari,
Nicola Santoro:
Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), August 25-30, 2002, Montréal, Québec, Canada
Kluwer 2002 |
| 103 | | Stefan Dobrev,
Paola Flocchini,
Rastislav Kralovic,
Giuseppe Prencipe,
Peter Ruzicka,
Nicola Santoro:
Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
OPODIS 2002: 169-180 |
| 102 | EE | Stefan Dobrev,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Searching for a black hole in arbitrary networks: optimal mobile agent protocols.
PODC 2002: 153-161 |
| 101 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Capture of an intruder by mobile agents.
SPAA 2002: 200-209 |
| 100 | EE | Elena Lodi,
Linda Pagli,
Nicola Santoro:
FUN with Algorithms - Foreword.
Theor. Comput. Sci. 282(2): 221-222 (2002) |
| 2001 |
|---|
| 99 | EE | Stefan Dobrev,
Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro:
Mobile Search for a Black Hole in an Anonymous Ring.
DISC 2001: 166-179 |
| 98 | EE | Elio Velasquez,
Nicola Santoro,
Amiya Nayak:
A Mobile Agent Prototype for Distributed Search.
MATA 2001: 245-254 |
| 97 | | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Pattern Formation by Anonymous Robots Without Chirality.
SIROCCO 2001: 147-162 |
| 96 | | Norbert Zeh,
Nicola Santoro:
On Finding Minimum Deadly Sets for Directed Networks.
SIROCCO 2001: 351-366 |
| 95 | EE | Nicola Santoro:
Distributed Computations by Autonomous Mobile Robots.
SOFSEM 2001: 110-115 |
| 94 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Gathering of Asynchronous Oblivious Robots with Limited Visibility.
STACS 2001: 247-258 |
| 93 | | Paola Flocchini,
Frédéric Geurts,
Nicola Santoro:
Optimal irreversible dynamos in chordal rings.
Discrete Applied Mathematics 113(1): 23-42 (2001) |
| 92 | EE | Evangelos Kranakis,
Nicola Santoro:
Distributed computing on oriented anonymous hypercubes with faulty components.
Distributed Computing 14(3): 185-189 (2001) |
| 2000 |
|---|
| 91 | EE | Paola Flocchini,
Evangelos Kranakis,
Nicola Santoro,
Danny Krizanc,
Flaminia L. Luccio:
Sorting Multisets in Anonymous Rings.
IPDPS 2000: 275-280 |
| 90 | | Una-May O'Reilly,
Nicola Santoro:
Asynchronous to Synchronous transformations.
OPODIS 2000: 265-282 |
| 89 | | Paola Flocchini,
Rastislav Kralovic,
Alessandro Roncato,
Peter Ruzicka,
Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies.
SIROCCO 2000: 111-125 |
| 88 | EE | Amiya Nayak,
J. Ren,
Nicola Santoro:
An improved testing scheme for catastrophic fault patterns.
Inf. Process. Lett. 73(5-6): 199-206 (2000) |
| 1999 |
|---|
| 87 | | Nicola Santoro,
Peter Widmayer:
Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA
Carleton Scientific 1999 |
| 86 | | Yuri Breitbart,
Sajal K. Das,
Nicola Santoro,
Peter Widmayer:
Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999
Carleton Scientific 1999 |
| 85 | EE | Paola Flocchini,
Giuseppe Prencipe,
Nicola Santoro,
Peter Widmayer:
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.
ISAAC 1999: 93-102 |
| 84 | | Paola Flocchini,
Alessandro Roncato,
Nicola Santoro:
Biconsistency and Homonymy in Distributed Systems with Edge Symmetry.
OPODIS 1999: 29-46 |
| 83 | EE | Paola Flocchini,
Alessandro Roncato,
Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems.
PODC 1999: 189-198 |
| 82 | | Paola Flocchini,
Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Monotone Dynamos in Tori.
SIROCCO 1999: 152-165 |
| 81 | | Yuri Breitbart,
Sajal K. Das,
Nicola Santoro,
Peter Widmayer:
Introduction: Distributed Data & Structures 2.
WDAS 1999 |
| 80 | EE | Paola Flocchini,
Frédéric Geurts,
Nicola Santoro:
Optimal Irreversible Dynamos in Chordal Rings.
WG 1999: 202-214 |
| 79 | | Nicola Santoro:
Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.
WG 1999: 29 |
| 1998 |
|---|
| 78 | EE | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Sense of Direction in Distributed Computing.
DISC 1998: 1-15 |
| 77 | EE | Paola Flocchini,
Elena Lodi,
Fabrizio Luccio,
Nicola Santoro:
Irreversible Dynamos in Tori.
Euro-Par 1998: 554-562 |
| 76 | | Nicola Santoro,
Peter Widmayer:
Introduction: Distributed Data and Structures 1.
WDAS 1998 |
| 75 | EE | Paola Flocchini,
Alessandro Roncato,
Nicola Santoro:
Symmetries and Sense of Direction in Labeled Graphs.
Discrete Applied Mathematics 87(1-3): 99-115 (1998) |
| 74 | | Bernard Mans,
Nicola Santoro:
Optimal Elections in Faulty Loop Networks and Applications.
IEEE Trans. Computers 47(3): 286-297 (1998) |
| 73 | EE | Esteban Feuerstein,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Nicola Santoro:
Efficient Token-Based Control in Rings.
Inf. Process. Lett. 66(4): 175-180 (1998) |
| 72 | | Paola Flocchini,
Nicola Santoro:
Topological Constraints for Sense of Direction.
Int. J. Found. Comput. Sci. 9(2): 179-198 (1998) |
| 71 | EE | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Sense of direction: Definitions, properties, and classes.
Networks 32(3): 165-180 (1998) |
| 1997 |
|---|
| 70 | | Edson Cáceres,
Frank K. H. A. Dehne,
Afonso Ferreira,
Paola Flocchini,
Ingo Rieping,
Alessandro Roncato,
Nicola Santoro,
Siang W. Song:
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
ICALP 1997: 390-400 |
| 69 | | Paola Flocchini,
Bernard Mans,
Alessandro Roncato,
Nicola Santoro:
Levels of Sense of Direction in Distributed Systems.
OPODIS 1997: 319-331 |
| 68 | | Mark H. Overmars,
Nicola Santoro:
Improved Bounds for Electing a Leader in a Synchronous Ring.
Algorithmica 18(2): 246-262 (1997) |
| 67 | EE | Alberto Negro,
Nicola Santoro,
Jorge Urrutia:
Efficient Distributed Selection with Bounded Messages.
IEEE Trans. Parallel Distrib. Syst. 8(4): 397-401 (1997) |
| 66 | EE | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
On the Impact of Sense of Direction on Message Complexity.
Inf. Process. Lett. 63(1): 23-31 (1997) |
| 65 | | Amos Israeli,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro:
Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput. 4(4): 317-341 (1997) |
| 64 | | Paola Flocchini,
Frédéric Geurts,
Nicola Santoro:
CA-Like Error Propagation in Fuzzy CA.
Parallel Computing 23(11): 1673-1682 (1997) |
| 1996 |
|---|
| 63 | | Nicola Santoro,
Paul G. Spirakis:
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996
Carleton Scientific 1996 |
| 62 | EE | Amiya Nayak,
Nicola Santoro,
Quanhu Xue:
Ring reconfiguration in presence of close fault cuts.
ISPAN 1996: 422-428 |
| 61 | | Esteban Feuerstein,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Nicola Santoro:
Efficient Token-Based Control in Rings (Abstract).
PODC 1996: 154 |
| 60 | | Paola Alimonti,
Paola Flocchini,
Nicola Santoro:
Finding the Extrema of a Distributed Multiset.
J. Parallel Distrib. Comput. 37(2): 123-133 (1996) |
| 1995 |
|---|
| 59 | | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Structural Information and Communication Complexity, 1st International Colloquium, SIROCCO 1994, Carleton University, Ottawa, Canada, May 18-20, 1994, Proceedings
Carleton University Press 1995 |
| 58 | | Selim G. Akl,
Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings
Springer 1995 |
| 57 | EE | Amiya Nayak,
Nicola Santoro,
Quanhu Xue:
Efficient reconfiguration technique for redundant ring networks.
HICSS (2) 1995: 489-498 |
| 56 | | Nicola Santoro,
J. Ren,
Amiya Nayak:
On the Complexity of Testing for Catastrophic Faults.
ISAAC 1995: 188-197 |
| 55 | | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Translation Capabilities of Sense of Direction.
SIROCCO 1995: 13-25 |
| 54 | | Paola Flocchini,
Nicola Santoro:
Topological Constraints for Sense of Direction.
SIROCCO 1995: 27-38 |
| 1994 |
|---|
| 53 | | Amos Israeli,
Evangelos Kranakis,
Danny Krizanc,
Nicola Santoro:
Time-Message Trade-Offs for the Weak Unison Problem.
CIAC 1994: 167-178 |
| 52 | | Bernard Mans,
Nicola Santoro:
Optimal Fault-Tolerant Leader Election in Chordal Rings.
FTCS 1994: 392-401 |
| 51 | | Bernard Mans,
Nicola Santoro:
On the Impact of Sense of Direction in Arbitrary Networks.
ICDCS 1994: 258-265 |
| 50 | | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Preface.
SIROCCO 1994 |
| 49 | | Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Sense of Direction: Formal Definitions and Properties.
SIROCCO 1994: 9-34 |
| 48 | | Paola Alimonti,
Paola Flocchini,
Nicola Santoro:
Finding the Extrema of a Distributed Multiset.
WDAG 1994: 164-178 |
| 47 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Nicola Santoro,
Jorge Urrutia,
Joseph Zaks:
Guarding rectangular art galleries.
Discrete Applied Mathematics 50(2): 149-157 (1994) |
| 46 | | Hans L. Bodlaender,
Gerard Tel,
Nicola Santoro:
Trade-Offs in Non-Reversing Diameter.
Nord. J. Comput. 1(1): 111-134 (1994) |
| 1993 |
|---|
| 45 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro,
Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings
Springer 1993 |
| 1992 |
|---|
| 44 | | Amiya Nayak,
Linda Pagli,
Nicola Santoro:
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links.
ICCI 1992: 79-83 |
| 43 | | Evangelos Kranakis,
Nicola Santoro:
Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).
WDAG 1992: 253-263 |
| 42 | | Una-May O'Reilly,
Nicola Santoro:
The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence.
WG 1992: 321-332 |
| 41 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity.
Theor. Comput. Sci. 100(1): 185-204 (1992) |
| 1991 |
|---|
| 40 | | Jan van Leeuwen,
Nicola Santoro:
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings
Springer 1991 |
| 39 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings
Springer 1991 |
| 38 | | Amiya Nayak,
Nicola Santoro:
Bounds on Performance of VLSI Processor Arrays.
IPPS 1991: 364-370 |
| 37 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Nicola Santoro,
Jorge Urrutia,
Joseph Zaks:
Tight Bounds for the Rectangualr Art Gallery Problem.
WG 1991: 105-112 |
| 36 | | Frank K. H. A. Dehne,
Anne-Lise Hassenklover,
Jörg-Rüdiger Sack,
Nicola Santoro:
Computational Geometry Algorithms for the Systolic Screen.
Algorithmica 6(5): 734-761 (1991) |
| 1990 |
|---|
| 35 | | Nicola Santoro,
Peter Widmayer:
Distributed Function Evaluation in the Presence of Transmission Faults.
SIGAL International Symposium on Algorithms 1990: 358-367 |
| 34 | EE | M. D. Atkinson,
Alberto Negro,
Nicola Santoro:
Sums of lexicographically ordered sets.
Discrete Mathematics 80(2): 115-122 (1990) |
| 1989 |
|---|
| 33 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings
Springer 1989 |
| 32 | | Mark H. Overmars,
Nicola Santoro:
TIME vs BITS.
STACS 1989: 282-293 |
| 31 | | Nicola Santoro,
Peter Widmayer:
Time is Not a Healer.
STACS 1989: 304-313 |
| 30 | | Hagit Attiya,
Jan van Leeuwen,
Nicola Santoro,
Shmuel Zaks:
Efficient Elections in Chordal Ring Networks.
Algorithmica 4(3): 437-446 (1989) |
| 29 | | Nicola Santoro,
Ed Suen:
Reduction Techniques for Selection in Distributed Files.
IEEE Trans. Computers 38(6): 891-896 (1989) |
| 28 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Partial Orders.
SIAM J. Discrete Math. 2(2): 245-254 (1989) |
| 1988 |
|---|
| 27 | | Nicola Santoro,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment, Common Roots of Polynomials and Partial Orders.
STACS 1988: 292-300 |
| 26 | | Nicola Santoro:
(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models.
WG 1988: 180-189 |
| 25 | | M. D. Atkinson,
Nicola Santoro:
A Practical Algorithm for Boolean Matrix Multiplication.
Inf. Process. Lett. 29(1): 37-38 (1988) |
| 24 | | Nicola Santoro,
Michael Scheutzow,
Jeffrey B. Sidney:
On the Expected Complexity of Distributed Selection.
J. Parallel Distrib. Comput. 5(2): 194-203 (1988) |
| 1987 |
|---|
| 23 | | Jan van Leeuwen,
Nicola Santoro,
Jorge Urrutia,
Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP 1987: 347-356 |
| 22 | | Ekow J. Otoo,
Nicola Santoro,
Doron Rotem:
Improving Semi-Join Evaluation in Distributed Query Processing.
ICDCS 1987: 554-561 |
| 21 | | Frank K. H. A. Dehne,
Nicola Santoro:
Optimal VLSI Dictionary Machines on Meshes.
ICPP 1987: 832-840 |
| 20 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Computing on a Systolic Screen: Hulls, Contours and Applications.
PARLE (1) 1987: 121-133 |
| 19 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
On the Expected Complexity of Distributed Selection.
STACS 1987: 456-467 |
| 18 | | Alberto Negro,
Nicola Santoro,
Jorge Urrutia:
On the Packet Complexity of Distributed Selection.
WDAG 1987: 108-115 |
| 17 | | Selim G. Akl,
Nicola Santoro:
Optimal Parallel Merging and Sorting Without Memory Conflicts.
IEEE Trans. Computers 36(11): 1367-1369 (1987) |
| 16 | | Doron Rotem,
Ephraim Korach,
Nicola Santoro:
Analysis of a Distributed Algorithm for Extrema Finding in a Ring.
J. Parallel Distrib. Comput. 4(6): 575-591 (1987) |
| 15 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Vector Dominance.
Theor. Comput. Sci. 53: 345-352 (1987) |
| 1986 |
|---|
| 14 | | Greg N. Frederickson,
Nicola Santoro:
Breaking Symmetry in Synchronous Networks.
Aegean Workshop on Computing 1986: 26-33 |
| 13 | | Nicola Santoro,
Ed Suen:
Reduction Techniques for Selection in Distributed Files.
ICPP 1986: 1003-1009 |
| 12 | | M. D. Atkinson,
Jörg-Rüdiger Sack,
Nicola Santoro,
Thomas Strothotte:
Min-Max Heaps and Generalized Priority Queues.
Commun. ACM 29(10): 996-1000 (1986) |
| 11 | EE | Victor Neumann-Lara,
Nicola Santoro,
Jorge Urrutia:
Uniquely colourable m-dichromatic oriented graphs.
Discrete Mathematics 62(1): 65-70 (1986) |
| 1985 |
|---|
| 10 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance.
STACS 1985: 322-327 |
| 9 | | Nicola Santoro,
Ramez Khatib:
Labelling and Implicit Routing in Networks.
Comput. J. 28(1): 5-8 (1985) |
| 8 | | Doron Rotem,
Nicola Santoro,
Jeffrey B. Sidney:
Distributed Sorting.
IEEE Trans. Computers 34(4): 372-376 (1985) |
| 7 | | Nicola Santoro,
Jeffrey B. Sidney:
Interpolation-Binary Search.
Inf. Process. Lett. 20(4): 179-181 (1985) |
| 1984 |
|---|
| 6 | EE | Ephraim Korach,
Doron Rotem,
Nicola Santoro:
Distributed Algorithms for Finding Centers and Medians in Networks.
ACM Trans. Program. Lang. Syst. 6(3): 380-401 (1984) |
| 5 | | Nicola Santoro:
Chain Multiplication of Matrices of Approximately or Exactly the Same Size.
Commun. ACM 27(2): 152-156 (1984) |
| 1980 |
|---|
| 4 | | Nicola Santoro:
Extending the Four Russians' Bound to General Matrix Multiplication.
Inf. Process. Lett. 10(2): 87-88 (1980) |
| 1979 |
|---|
| 3 | | Raúl J. Ramírez,
Nicola Santoro:
Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm.
Berkeley Workshop 1979: 191- |
| 1976 |
|---|
| 2 | | Nicola Santoro:
Full Table Search by Polynomial Functions.
Inf. Process. Lett. 5(3): 72-74 (1976) |
| 1 | | Elena Lodi,
Fabrizio Luccio,
Linda Pagli,
Nicola Santoro:
Random access in a list environment.
Inf. Syst. 2(1): 11-17 (1976) |
