default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Santoro
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j121]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe
, Nicola Santoro:
Locating a black hole in a dynamic ring. J. Parallel Distributed Comput. 196: 104998 (2025)- 2024
- [j120]David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro:
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distributed Comput. 37(3): 279-308 (2024) - [c185]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Variations on the Tournament Problem. FUN 2024: 20:1-20:11 - [c184]Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita:
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. IWOCA 2024: 472-484 - [c183]Nicola Santoro:
Keynote: Time is not a Healer: Before and After. PODC 2024: 1 - [i29]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Black Hole Search by a Set of Scattered Agents in Dynamic Rings. CoRR abs/2404.15132 (2024) - [i28]Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Cops & Robber on Periodic Temporal Graphs. CoRR abs/2410.22618 (2024) - 2023
- [j119]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Asynchronous Gathering in a Dangerous Ring. Algorithms 16(5): 222 (2023) - [j118]Nooshin Nokhanji, Paola Flocchini, Nicola Santoro:
Dynamic Line Maintenance by Hybrid Programmable Matter. Int. J. Netw. Comput. 13(1): 18-47 (2023) - [c182]Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. OPODIS 2023: 28:1-28:23 - [c181]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Black Hole Search in Dynamic Rings: The Scattered Case. OPODIS 2023: 33:1-33:18 - [c180]Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. SIROCCO 2023: 386-405 - [i27]Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard:
Copnumbers of periodic graphs. CoRR abs/2310.13616 (2023) - [i26]Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. CoRR abs/2311.03328 (2023) - 2022
- [j117]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. Distributed Comput. 35(2): 105-122 (2022) - [j116]Jacopo Bonet, Brittany Galuppo, Nicola Santoro, Chiara Dalla Man:
A New Oral Model to Assess Postprandial Lactate Production Rate. IEEE Trans. Biomed. Eng. 69(4): 1533-1540 (2022) - [c179]Nooshin Nokhanji, Paola Flocchini, Nicola Santoro:
Fully Dynamic Line Maintenance by a Simple Robot. ICARA 2022: 108-112 - [c178]Nooshin Nokhanji, Paola Flocchini, Nicola Santoro:
Fully Dynamic Line Maintenance by Hybrid Programmable Matter. IPDPS Workshops 2022: 486-495 - [c177]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. SIROCCO 2022: 42-61 - [i25]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. CoRR abs/2203.06546 (2022) - 2021
- [j115]Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, Nicola Santoro:
Exploration of dynamic networks: Tight bounds on the number of agents. J. Comput. Syst. Sci. 122: 1-18 (2021) - [j114]Mohsen Eftekhari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro:
On synchronization and orientation in distributed barrier coverage with relocatable sensors. Theor. Comput. Sci. 887: 1-10 (2021) - [c176]Nooshin Nokhanji, Nicola Santoro:
Self-Repairing Line of Metamorphic Robots. ICARA 2021: 55-59 - [c175]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Black Hole Search in Dynamic Rings. ICDCS 2021: 987-997 - [c174]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
Autonomous Mobile Robots: Refining the Computational Landscape. IPDPS Workshops 2021: 576-585 - [c173]David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro:
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. PODC 2021: 9-19 - [i24]David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro:
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. CoRR abs/2105.13042 (2021) - 2020
- [j113]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Forming Sequences of Patterns With Luminous Robots. IEEE Access 8: 90577-90597 (2020) - [j112]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Distributed exploration of dynamic rings. Distributed Comput. 33(1): 41-67 (2020) - [j111]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape formation by programmable particles. Distributed Comput. 33(1): 69-101 (2020) - [j110]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a polygon by anonymous oblivious robots. Distributed Comput. 33(5): 445-469 (2020) - [j109]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Fault-tolerant simulation of population protocols. Distributed Comput. 33(6): 561-578 (2020) - [j108]Paola Flocchini, Eman Omar, Nicola Santoro:
Effective Energy Restoration of Wireless Sensor Networks by a Mobile Robot. Int. J. Netw. Comput. 10(2): 62-83 (2020) - [j107]Kangqing Yu, Wei Shi, Nicola Santoro:
Designing a Streaming Algorithm for Outlier Detection in Data Mining - An Incrementa Approach. Sensors 20(5): 1261 (2020) - [j106]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in dynamic rings. Theor. Comput. Sci. 811: 79-98 (2020) - [c172]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Mobile RAM and Shape Formation by Programmable Particles. Euro-Par 2020: 343-358 - [c171]Subhash Bhagat, Paola Flocchini, Krishnendu Mukhopadhyaya, Nicola Santoro:
Weak robots performing conflicting tasks without knowing who is in their team. ICDCN 2020: 29:1-29:6 - [c170]Osama I. Aloqaily, Paola Flocchini, Nicola Santoro:
Achieving Immortality in Wireless Rechargeable Sensor Networks Using Local Learning. ISNCC 2020: 1-6 - [c169]Nooshin Nokhanji, Nicola Santoro:
Line Reconfiguration by Programmable Particles Maintaining Connectivity. TPNC 2020: 157-169 - [i23]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Mobile RAM and Shape Formation by Programmable Particles. CoRR abs/2002.03384 (2020) - [i22]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Tight Bounds for Black Hole Search in Dynamic Rings. CoRR abs/2005.07453 (2020) - [i21]Paola Flocchini, Nicola Santoro, Masafumi Yamashita, Yukiko Yamauchi:
Synchronization by Asynchronous Mobile Robots with Limited Visibility. CoRR abs/2006.03249 (2020)
2010 – 2019
- 2019
- [j105]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population protocols with faulty interactions: The impact of a leader. Theor. Comput. Sci. 754: 35-49 (2019) - [c168]Eman Omar, Paola Flocchini, Nicola Santoro:
Perpetual Energy Restoration by Multiple Mobile Robots in Circular Sensor Networks. AICCSA 2019: 1-8 - [c167]Paola Flocchini, Eman Omar, Nicola Santoro:
Effective Decentralized Energy Restoration by a Mobile Robot. CANDAR 2019: 73-81 - [c166]Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita:
Gathering and Election by Mobile Robots in a Continuous Cycle. ISAAC 2019: 8:1-8:19 - [c165]Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, Nicola Santoro:
Tight Bounds on Distributed Exploration of Temporal Graphs. OPODIS 2019: 22:1-22:16 - [c164]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. OPODIS 2019: 24:1-24:16 - [c163]Paola Flocchini, Nicola Santoro, Koichi Wada:
On Memory, Communication, and Synchronous Schedulers When Moving and Computing. OPODIS 2019: 25:1-25:17 - [c162]Kangqing Yu, Wei Shi, Nicola Santoro, Xiangyu Ma:
Real-time Outlier Detection Over Streaming Data. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2019: 125-132 - [p4]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Moving and Computing Models: Robots. Distributed Computing by Mobile Entities 2019: 3-14 - [p3]Shantanu Das, Nicola Santoro:
Moving and Computing Models: Agents. Distributed Computing by Mobile Entities 2019: 15-34 - [e15]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science 11340, Springer 2019, ISBN 978-3-030-11071-0 [contents] - [i20]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. CoRR abs/1911.05239 (2019) - 2018
- [c161]Eman Omar, Paola Flocchini, Nicola Santoro:
Energy Restoration in a Linear Sensor Network. AICCSA 2018: 1-8 - [c160]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Line Recovery by Programmable Particles. ICDCN 2018: 4:1-4:10 - [c159]Eman Omar, Paola Flocchini, Nicola Santoro:
Online Energy Restoration by a Mobile Robot in a Ring of Sensors. IWCMC 2018: 654-659 - [c158]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications. DISC 2018: 19:1-19:18 - 2017
- [j104]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed computing by mobile robots: uniform circle formation. Distributed Comput. 30(6): 413-457 (2017) - [j103]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual visibility by luminous robots without collisions. Inf. Comput. 254: 392-418 (2017) - [j102]Stefan Dobrev, Rastislav Královic, Nicola Santoro:
On the Cost of Waking Up. Int. J. Netw. Comput. 7(2): 336-348 (2017) - [c157]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population Protocols with Faulty Interactions: The Impact of a Leader. CIAC 2017: 454-466 - [c156]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. ICDCS 2017: 2472-2477 - [c155]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape Formation by Programmable Particles. OPODIS 2017: 31:1-31:16 - [c154]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. SIROCCO 2017: 339-355 - [c153]Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
Mediated Population Protocols: Leader Election and Applications. TAMC 2017: 172-186 - [c152]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a Polygon by Anonymous Oblivious Robots. DISC 2017: 14:1-14:15 - [c151]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Brief Announcement: Shape Formation by Programmable Particles. DISC 2017: 48:1-48:3 - [i19]Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. CoRR abs/1704.02427 (2017) - [i18]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. CoRR abs/1705.00324 (2017) - [i17]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape Formation by Programmable Particles. CoRR abs/1705.03538 (2017) - [i16]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Line-Recovery by Programmable Particles. CoRR abs/1707.05041 (2017) - [i15]Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications. CoRR abs/1709.08800 (2017) - 2016
- [j101]Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination under m-immunity. Discret. Appl. Math. 201: 114-129 (2016) - [j100]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita:
Autonomous mobile robots with lights. Theor. Comput. Sci. 609: 171-184 (2016) - [j99]Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Exploring an unknown dangerous graph with a constant number of tokens. Theor. Comput. Sci. 610: 169-181 (2016) - [j98]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous with constant memory. Theor. Comput. Sci. 621: 57-72 (2016) - [c150]Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
A Rupestrian Algorithm. FUN 2016: 14:1-14:20 - [c149]Stefan Dobrev, Rastislav Kralovic, Nicola Santoro:
On the Complexity of Distributed Wake-Up. CANDAR 2016: 559-564 - [c148]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Live Exploration of Dynamic Rings. ICDCS 2016: 570-579 - [c147]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Universal Systems of Oblivious Mobile Robots. SIROCCO 2016: 242-257 - [i14]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Implicit Function Computation by Oblivious Mobile Robots. CoRR abs/1602.04881 (2016) - [i13]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. CoRR abs/1610.09435 (2016) - [i12]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population Protocols with Faulty Interactions: the Impact of a Leader. CoRR abs/1611.06864 (2016) - 2015
- [j97]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
Forming sequences of geometric patterns with oblivious mobile robots. Distributed Comput. 28(2): 131-145 (2015) - [j96]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. Int. J. Found. Comput. Sci. 26(4): 499-522 (2015) - [j95]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590: 27-37 (2015) - [c146]Jie Cai, Paola Flocchini, Nicola Santoro:
Distributed Black Virus Decontamination and Rooted Acyclic Orientations. CIT/IUCC/DASC/PICom 2015: 1681-1688 - [c145]Nicola Santoro:
Time to Change: On Distributed Computing in Dynamic Networks (Keynote). OPODIS 2015: 3:1-3:14 - [c144]Jie Cai, Paola Flocchini, Nicola Santoro:
Black Virus Decontamination in Arbitrary Networks. WorldCIST (1) 2015: 991-1000 - [i11]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
Mutual Visibility by Luminous Robots Without Collisions. CoRR abs/1503.04347 (2015) - [i10]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Live Exploration of Dynamic Rings. CoRR abs/1512.05306 (2015) - 2014
- [j94]Jie Cai, Paola Flocchini, Nicola Santoro:
Decontaminating a Network from a Black Virus. Int. J. Netw. Comput. 4(1): 151-173 (2014) - [j93]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Measuring Temporal Lags in Delay-Tolerant Networks. IEEE Trans. Computers 63(2): 397-410 (2014) - [c143]Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta:
The Mutual Visibility Problem for Oblivious Robots. CCCG 2014 - [c142]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Synchronized Dancing of Oblivious Chameleons. FUN 2014: 113-124 - [c141]Eduardo Mesa Barrameda, Nicola Santoro, Wei Shi, Najmeh Taleb:
Sensor deployment by a robot in an unknown orthogonal region: Achieving full coverage. ICPADS 2014: 951-960 - [c140]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. OPODIS 2014: 217-232 - [c139]Mohsen Eftekhari Hesari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro:
Distributed Barrier Coverage with Relocatable Sensors. SIROCCO 2014: 235-249 - [c138]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta:
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. SSS 2014: 150-164 - [i9]Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta:
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. CoRR abs/1405.2430 (2014) - [i8]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. CoRR abs/1407.5917 (2014) - 2013
- [j92]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65(3): 562-583 (2013) - [j91]Paola Flocchini, Bernard Mans, Nicola Santoro:
On the exploration of time-varying networks. Theor. Comput. Sci. 469: 53-68 (2013) - [j90]Stefan Dobrev, Paola Flocchini, Rastislav Královic, Nicola Santoro:
Exploring an unknown dangerous graph using tokens. Theor. Comput. Sci. 472: 28-45 (2013) - [c137]Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro:
Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes. ALGOSENSORS 2013: 228-243 - [c136]Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Optimal Network Decontamination with Threshold Immunity. CIAC 2013: 234-245 - [c135]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs. FCT 2013: 95-106 - [c134]Jie Cai, Paola Flocchini, Nicola Santoro:
Network Decontamination from a Black Virus. IPDPS Workshops 2013: 696-705 - [c133]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. SIROCCO 2013: 189-200 - [c132]Nicola Santoro:
Mobility and Computations: Some Open Research Directions. WALCOM 2013: 1-3 - [i7]Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. CoRR abs/1306.1956 (2013) - 2012
- [b2]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2012, ISBN 978-3-031-00880-1 - [j89]Paola Flocchini, David Ilcinkas, Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica 62(3-4): 1006-1033 (2012) - [j88]Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. Inf. Comput. 219: 1-16 (2012) - [j87]Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Searching for Black Holes in Subways. Theory Comput. Syst. 50(1): 158-184 (2012) - [j86]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distributed Syst. 27(5): 387-408 (2012) - [j85]Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Distributed Computing by Mobile Robots: Gathering. SIAM J. Comput. 41(4): 829-879 (2012) - [j84]Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures. IEEE Trans. Computers 61(3): 408-414 (2012) - [c131]Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Finding Good Coffee in Paris. FUN 2012: 154-165 - [c130]Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita:
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. ICDCS 2012: 506-515 - [c129]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks. PODC 2012: 99-100 - [c128]Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. SIROCCO 2012: 279-290 - [c127]Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents. SSS 2012: 299-313 - [p2]Paola Flocchini, Nicola Santoro:
Distributed Security Algorithms for Mobile Agents. Mobile Agents in Networking and Distributed Computing 2012: 41-70 - [i6]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Building Fastest Broadcast Trees in Periodically-Varying Graphs. CoRR abs/1204.3058 (2012) - [i5]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975 (2012) - [i4]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast. CoRR abs/1210.3277 (2012) - 2011
- [j83]Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Time Optimal Algorithms for Black Hole Search in Rings. Discret. Math. Algorithms Appl. 3(4): 457-472 (2011) - [j82]Lali Barrière, Paola Flocchini, Eduardo Mesa Barrameda, Nicola Santoro:
Uniform Scattering of Autonomous Mobile Robots in a Grid. Int. J. Found. Comput. Sci. 22(3): 679-697 (2011) - [j81]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
How many oblivious robots can explore a line. Inf. Process. Lett. 111(20): 1027-1031 (2011) - [j80]Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola Santoro:
A Reference Model for Semantic Peer-to-Peer Networks. J. Data Semant. 15: 37-65 (2011) - [j79]Matt Duckham, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Trans. Computers 60(8): 1100-1113 (2011) - [j78]Beat Gfeller, Nicola Santoro, Peter Widmayer:
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. IEEE Trans. Dependable Secur. Comput. 8(1): 1-12 (2011) - [j77]Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenovic:
Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage. IEEE Trans. Mob. Comput. 10(11): 1520-1533 (2011) - [c126]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-Varying Graphs and Dynamic Networks. ADHOC-NOW 2011: 346-359 - [c125]Elio Velazquez, Nicola Santoro:
Neighbour Selection and Sensor Knowledge: Proactive Approach for the Frugal Feeding Problem in Wireless Sensor Networks. ADHOCNETS 2011: 162-176 - [c124]Frédéric Amblard, Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
On the temporal analysis of scientific network evolution. CASoN 2011: 169-174 - [c123]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Measuring Temporal Lags in Delay-Tolerant Networks. IPDPS 2011: 209-218 - [c122]Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Improving the Optimal Bounds for Black Hole Search in Rings. SIROCCO 2011: 198-209 - [c121]Nicola Santoro:
Computing in Time-Varying Networks. SSS 2011: 4 - [p1]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Computing by Mobile Robotic Sensors. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 655-693 - [i3]Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, Frédéric Amblard:
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics. CoRR abs/1102.0629 (2011) - 2010
- [j76]Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola Santoro:
From P2P to reliable semantic P2P systems. Peer-to-Peer Netw. Appl. 3(4): 363-381 (2010) - [j75]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14-15): 1583-1598 (2010) - [c120]Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Time Optimal Algorithms for Black Hole Search in Rings. COCOA (2) 2010: 58-71 - [c119]Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Mapping an Unfriendly Subway System. FUN 2010: 190-201 - [c118]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. IFIP TCS 2010: 111-124 - [c117]Elio Velazquez, Nicola Santoro:
Mobility-Based Strategies for Energy Restoration in Wireless Sensor Networks. MSN 2010: 161-168 - [c116]Doron Nussbaum, Nicola Santoro:
On the Message Complexity of Global Computations. OPODIS 2010: 427-442 - [c115]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
On the computational power of oblivious robots: forming a series of geometric patterns. PODC 2010: 267-276 - [c114]Elio Velazquez, Nicola Santoro, Mark Lanthier:
Pro-active Strategies for the Frugal Feeding Problem in Wireless Sensor Networks. S-CUBE 2010: 189-204 - [c113]Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro:
Network Exploration by Silent and Oblivious Robots. WG 2010: 208-219 - [i2]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-Varying Graphs and Dynamic Networks. CoRR abs/1012.0009 (2010)
2000 – 2009
- 2009
- [j74]Paola Flocchini, Andrzej Pelc, Nicola Santoro:
Fault-Tolerant Sequential Scan. Theory Comput. Syst. 45(1): 1-26 (2009) - [j73]Xu Li, Nicola Santoro, Ivan Stojmenovic:
Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks. IEEE Trans. Computers 58(9): 1275-1288 (2009) - [c112]Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenovic:
Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization. ICC 2009: 1-5 - [c111]Lali Barrière, Paola Flocchini, Eduardo Mesa Barrameda, Nicola Santoro:
Uniform scattering of autonomous mobile robots in a grid. IPDPS 2009: 1-8 - [c110]Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Map construction and exploration by mobile agents scattered in a dangerous network. IPDPS 2009: 1-10 - [c109]Paola Flocchini, Bernard Mans, Nicola Santoro:
Exploration of Periodically Varying Graphs. ISAAC 2009: 534-543 - [c108]Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenovic:
Focused-Coverage by Mobile Sensor Networks. MASS 2009: 466-475 - [c107]Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola Santoro:
A Reference Model for Semantic Peer-to-Peer Networks. MCETECH 2009: 319-334 - [c106]Elio Velazquez, Nicola Santoro:
Distributed Facility Location for Sensor Network Maintenance. MSN 2009: 237-243 - [c105]Nicola Santoro:
Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing. DISC 2009: 6 - [e14]Tarek F. Abdelzaher, Michel Raynal, Nicola Santoro:
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings. Lecture Notes in Computer Science 5923, Springer 2009, ISBN 978-3-642-10876-1 [contents] - [i1]Paola Flocchini, Bernard Mans, Nicola Santoro:
Exploration of Periodically Varying Graphs. CoRR abs/0909.4369 (2009) - 2008
- [j72]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) - [j71]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Computing all the best swap edges distributively. J. Parallel Distributed Comput. 68(7): 976-983 (2008) - [j70]Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenovic:
Localized sensor self-deployment with coverage guarantee. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(2): 50-52 (2008) - [j69]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399(1-2): 101-117 (2008) - [j68]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Self-deployment of mobile sensors on a ring. Theor. Comput. Sci. 402(1): 67-80 (2008) - [j67]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) - [c104]Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro:
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments. ALGOSENSORS 2008: 125-140 - [c103]Paola Flocchini, Bernard Mans, Nicola Santoro:
Tree Decontamination with Temporary Immunity. ISAAC 2008: 330-341 - [c102]Xu Li, Nicola Santoro, Ivan Stojmenovic:
Localized distance-sensitive service discovery in wireless sensor networks. FOWANC 2008: 85-92 - [c101]Nicola Santoro:
Mobile Entities Computing: Models and Problems. SIROCCO 2008: 1 - [c100]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47 - [c99]Paola Flocchini, David Ilcinkas, Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241 - 2007
- [b1]Nicola Santoro:
Design and analysis of distributed algorithms. Wiley series on parallel and distributed computing, Wiley 2007, ISBN 978-0-471-71997-7, pp. I-XVIII, 1-589 - [j66]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Mobile Search for a Black Hole in an Anonymous Ring. Algorithmica 48(1): 67-90 (2007) - [j65]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination in Presence of Local Immunity. Int. J. Found. Comput. Sci. 18(3): 457-474 (2007) - [j64]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) - [j63]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) - [j62]Nicola Santoro, Peter Widmayer:
Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3): 232-249 (2007) - [j61]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) - [c98]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 - [c97]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 - [c96]Nicola Santoro:
Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs. FUN 2007: 14 - [c95]Stefan Dobrev, Nicola Santoro, Wei Shi:
Scattered Black Hole Search in an Oriented Ring using Tokens. IPDPS 2007: 1-8 - [c94]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118 - [c93]Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. SIROCCO 2007: 289-303 - [c92]Xu Li, Nicola Santoro, Ivan Stojmenovic:
Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks. UIC 2007: 696-708 - [c91]Jérémie Chalopin, Shantanu Das, Nicola Santoro:
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. DISC 2007: 108-122 - [c90]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 - [r1]Nicola Santoro, Peter Widmayer:
Distributed Computing in the Presence of Mobile Faults. Handbook of Parallel Computing 2007 - 2006
- [j60]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Comput. 19(1): 1-35 (2006) - [j59]Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro:
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively. IEICE Trans. Inf. Syst. 89-D(2): 700-708 (2006) - [j58]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) - [c89]F. Ahmad, Nicola Santoro, Amiya Nayak, Nishith Goel, Alok R. Patnaik, Alka Srivastava:
Solving Distributed Mutual Exclusion using Cooperating Mobile Agents. ACIS-ICIS 2006: 458-463 - [c88]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Self-deployment Algorithms for Mobile Sensors on a Ring. ALGOSENSORS 2006: 59-70 - [c87]Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi:
Black Hole Search in Asynchronous Rings Using Tokens. CIAC 2006: 139-150 - [c86]Paola Flocchini, Nicola Santoro:
Distributed Security Algorithms by Mobile Agents. ICDCN 2006: 1-14 - [c85]Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search. ICDCS 2006: 57 - [c84]Nicola Santoro:
Distributed Algorithms for Autonomous Mobile Robots. IFIP TCS 2006: 11 - [c83]Giuseppe Prencipe, Nicola Santoro:
Distributed Algorithms for Autonomous Mobile Robots. IFIP TCS 2006: 47-62 - [c82]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Nicola Santoro:
Exploring an Unknown Graph to Locate a Black Hole Using Tokens. IFIP TCS 2006: 131-150 - [c81]Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Network decontamination with local immunization. IPDPS 2006 - [c80]Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro:
Effective Elections for Anonymous Mobile Agents. ISAAC 2006: 732-743 - [c79]Xu Li, Nicola Santoro:
ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks. LCN 2006: 923-930 - [c78]Xu Li, Nicola Santoro:
An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks. MSN 2006: 847-860 - [c77]Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola Santoro:
Issues for Robust Consensus Building in P2P Networks. OTM Workshops (2) 2006: 1021-1027 - [c76]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 - [c75]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211 - [c74]Jérémie Chalopin, Shantanu Das, Nicola Santoro:
Groupings and Pairings in Anonymous Networks. DISC 2006: 105-119 - 2005
- [j57]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3): 147-168 (2005) - [c73]Nicola Santoro:
Mobile Agents Computing: Security Issues and Algorithmic Solutions. ICTCS 2005: 22 - [c72]Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro:
Distributed Exploration of an Unknown Graph. SIROCCO 2005: 99-114 - [c71]Nicola Santoro, Peter Widmayer:
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. SIROCCO 2005: 262-276 - 2004
- [j56]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Dynamic monopolies in tori. Discret. Appl. Math. 137(2): 197-212 (2004) - [j55]Elena Lodi, Linda Pagli, Nicola Santoro:
Fun with algorithms. Discret. Appl. Math. 144(3): 229-230 (2004) - [j54]Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro:
Sorting and election in anonymous asynchronous rings. J. Parallel Distributed Comput. 64(2): 254-265 (2004) - [c70]Abdul-Rahman Mawlood-Yunis, Amiya Nayak, Doron Nussbaum, Nicola Santoro:
Comparing Performance of Two Mobile Agent Platforms in Distributed Search. IAT 2004: 425-428 - [c69]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 - [c68]Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk:
Multiple Mobile Agent Rendezvous in a Ring. LATIN 2004: 599-608 - [c67]Abdul-Rahman Mawlood-Yunis, Amiya Nayak, Doron Nussbaum, Nicola Santoro:
On the Performance of Distributed Search by Mobile Agents. MATA 2004: 285-294 - [c66]Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Tranos Zuva:
Computing All the Best Swap Edges Distributively. OPODIS 2004: 154-168 - [c65]Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Improved Bounds for Optimal Black Hole Search with a Network Map. SIROCCO 2004: 111-122 - [c64]Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro, Cindy Sawchuk:
Mobile Agents Rendezvous When Tokens Fail. SIROCCO 2004: 161-172 - 2003
- [j53]Una-May O'Reilly, Nicola Santoro:
Tight Bounds for Synchronous Communication of Information Using Bits, Silence. Discret. Appl. Math. 129(1): 195-209 (2003) - [j52]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) - [j51]Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems. SIAM J. Comput. 32(2): 281-306 (2003) - [j50]Paola Flocchini, Bernard Mans, Nicola Santoro:
Sense of direction in distributed computing. Theor. Comput. Sci. 291(1): 29-53 (2003) - [j49]Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Computing on anonymous networks with sense of direction. Theor. Comput. Sci. 301(1-3): 355-379 (2003) - [c63]Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Solving the Robots Gathering Problem. ICALP 2003: 1181-1196 - [c62]Evangelos Kranakis, Nicola Santoro, Cindy Sawchuk, Danny Krizanc:
Mobile Agent Rendezvous in a Ring. ICDCS 2003: 592-599 - [c61]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Multiple Agents RendezVous in a Ring in Spite of a Black Hole. OPODIS 2003: 34-46 - [c60]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. SIROCCO 2003: 17-32 - [c59]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Can we elect if we cannot compare? SPAA 2003: 324-332 - [c58]Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos:
Searching Is Not Jumping. WG 2003: 34-45 - 2002
- [j48]Elena Lodi, Linda Pagli, Nicola Santoro:
FUN with Algorithms - Foreword. Theor. Comput. Sci. 282(2): 221-222 (2002) - [c57]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 - [c56]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Searching for a black hole in arbitrary networks: optimal mobile agent protocols. PODC 2002: 153-161 - [c55]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Capture of an intruder by mobile agents. SPAA 2002: 200-209 - [e13]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. IFIP Conference Proceedings 223, Kluwer 2002, ISBN 1-4020-7181-7 [contents] - 2001
- [j47]Paola Flocchini, Frédéric Geurts, Nicola Santoro:
Optimal irreversible dynamos in chordal rings. Discret. Appl. Math. 113(1): 23-42 (2001) - [j46]Evangelos Kranakis, Nicola Santoro:
Distributed computing on oriented anonymous hypercubes with faulty components. Distributed Comput. 14(3): 185-189 (2001) - [c54]Elio Velazquez, Nicola Santoro, Amiya Nayak:
A Mobile Agent Prototype for Distributed Search. MATA 2001: 245-254 - [c53]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Pattern Formation by Anonymous Robots Without Chirality. SIROCCO 2001: 147-162 - [c52]Norbert Zeh, Nicola Santoro:
On Finding Minimum Deadly Sets for Directed Networks. SIROCCO 2001: 351-366 - [c51]Nicola Santoro:
Distributed Computations by Autonomous Mobile Robots. SOFSEM 2001: 110-115 - [c50]Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS 2001: 247-258 - [c49]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Mobile Search for a Black Hole in an Anonymous Ring. DISC 2001: 166-179 - 2000
- [j45]Amiya Nayak, Jiajun Ren, Nicola Santoro:
An improved testing scheme for catastrophic fault patterns. Inf. Process. Lett. 73(5-6): 199-206 (2000) - [c48]Paola Flocchini, Evangelos Kranakis, Nicola Santoro, Danny Krizanc, Flaminia L. Luccio:
Sorting Multisets in Anonymous Rings. IPDPS 2000: 275-280 - [c47]Una-May O'Reilly, Nicola Santoro:
Asynchronous to Synchronous transformations. OPODIS 2000: 265-282 - [c46]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
1990 – 1999
- 1999
- [c45]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 - [c44]Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Biconsistency and Homonymy in Distributed Systems with Edge Symmetry. OPODIS 1999: 29-46 - [c43]Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems. PODC 1999: 189-198 - [c42]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Monotone Dynamos in Tori. SIROCCO 1999: 152-165 - [c41]Yuri Breitbart, Sajal K. Das, Nicola Santoro, Peter Widmayer:
Introduction: Distributed Data & Structures 2. WDAS 1999 - [c40]Nicola Santoro:
Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone. WG 1999: 29 - [c39]Paola Flocchini, Frédéric Geurts, Nicola Santoro:
Optimal Irreversible Dynamos in Chordal Rings. WG 1999: 202-214 - [e12]Nicola Santoro, Peter Widmayer:
Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA. Proceedings in Informatics 2, Carleton Scientific 1999, ISBN 1-894145-02-X [contents] - [e11]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. Proceedings in Informatics 6, Carleton Scientific 1999, ISBN 1-894145-05-4 [contents] - 1998
- [j44]Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Symmetries and Sense of Direction in Labeled Graphs. Discret. Appl. Math. 87(1-3): 99-115 (1998) - [j43]Paola Flocchini, Nicola Santoro:
Topological Constraints for Sense of Direction. Int. J. Found. Comput. Sci. 9(2): 179-198 (1998) - [j42]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings. Inf. Process. Lett. 66(4): 175-180 (1998) - [j41]Paola Flocchini, Bernard Mans, Nicola Santoro:
Sense of direction: Definitions, properties, and classes. Networks 32(3): 165-180 (1998) - [j40]Bernard Mans, Nicola Santoro:
Optimal Elections in Faulty Loop Networks and Applications. IEEE Trans. Computers 47(3): 286-297 (1998) - [c38]Paola Flocchini, Elena Lodi, Fabrizio Luccio, Nicola Santoro:
Irreversible Dynamos in Tori. Euro-Par 1998: 554-562 - [c37]Paola Flocchini, Bernard Mans, Nicola Santoro:
Sense of Direction in Distributed Computing. DISC 1998: 1-15 - [c36]Nicola Santoro, Peter Widmayer:
Introduction: Distributed Data and Structures 1. WDAS 1998 - 1997
- [j39]Mark H. Overmars, Nicola Santoro:
Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica 18(2): 246-262 (1997) - [j38]Paola Flocchini, Bernard Mans, Nicola Santoro:
On the Impact of Sense of Direction on Message Complexity. Inf. Process. Lett. 63(1): 23-31 (1997) - [j37]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) - [j36]Paola Flocchini, Frédéric Geurts, Nicola Santoro:
CA-Like Error Propagation in Fuzzy CA. Parallel Comput. 23(11): 1673-1682 (1997) - [j35]Alberto Negro, Nicola Santoro, Jorge Urrutia:
Efficient Distributed Selection with Bounded Messages. IEEE Trans. Parallel Distributed Syst. 8(4): 397-401 (1997) - [c35]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 - [c34]Paola Flocchini, Bernard Mans, Alessandro Roncato, Nicola Santoro:
Levels of Sense of Direction in Distributed Systems. OPODIS 1997: 319-331 - 1996
- [j34]Amiya Nayak, Linda Pagli, Nicola Santoro:
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy. Integr. 20(3): 327-342 (1996) - [j33]Paola Alimonti, Paola Flocchini, Nicola Santoro:
Finding the Extrema of a Distributed Multiset. J. Parallel Distributed Comput. 37(2): 123-133 (1996) - [c33]Amiya Nayak, Nicola Santoro, Quanhu Xue:
Ring reconfiguration in presence of close fault cuts. ISPAN 1996: 422-428 - [c32]Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings (Abstract). PODC 1996: 154 - [e10]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 [contents] - 1995
- [j32]Amiya Nayak, Nicola Santoro:
On Reliability Analysis of Chordal Rings. J. Circuits Syst. Comput. 5(2): 199-214 (1995) - [c31]Amiya Nayak, Nicola Santoro, Quanhu Xue:
Efficient reconfiguration technique for redundant ring networks. HICSS (2) 1995: 489-498 - [c30]Nicola Santoro, Jiajun Ren, Amiya Nayak:
On the Complexity of Testing for Catastrophic Faults. ISAAC 1995: 188-197 - [c29]Paola Flocchini, Bernard Mans, Nicola Santoro:
Translation Capabilities of Sense of Direction. SIROCCO 1995: 13-25 - [c28]Paola Flocchini, Nicola Santoro:
Topological Constraints for Sense of Direction. SIROCCO 1995: 27-38 - [e9]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, ISBN 0-88629-253-0 [contents] - [e8]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. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8 [contents] - 1994
- [j31]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Guarding rectangular art galleries. Discret. Appl. Math. 50(2): 149-157 (1994) - [j30]Hans L. Bodlaender, Gerard Tel, Nicola Santoro:
Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. 1(1): 111-134 (1994) - [c27]Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro:
Time-Message Trade-Offs for the Weak Unison Problem. CIAC 1994: 167-178 - [c26]Bernard Mans, Nicola Santoro:
Optimal Fault-Tolerant Leader Election in Chordal Rings. FTCS 1994: 392-401 - [c25]Bernard Mans, Nicola Santoro:
On the Impact of Sense of Direction in Arbitrary Networks. ICDCS 1994: 258-265 - [c24]Paola Flocchini, Bernard Mans, Nicola Santoro:
Preface. SIROCCO 1994 - [c23]Paola Flocchini, Bernard Mans, Nicola Santoro:
Sense of Direction: Formal Definitions and Properties. SIROCCO 1994: 9-34 - [c22]Paola Alimonti, Paola Flocchini, Nicola Santoro:
Finding the Extrema of a Distributed Multiset. WDAG 1994: 164-178 - 1993
- [j29]Amiya Nayak, Linda Pagli, Nicola Santoro:
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. Integr. 15(2): 133-150 (1993) - [e7]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. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8 [contents] - 1992
- [j28]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) - [c21]Amiya Nayak, Linda Pagli, Nicola Santoro:
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. ICCI 1992: 79-83 - [c20]Evangelos Kranakis, Nicola Santoro:
Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract). WDAG 1992: 253-263 - [c19]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 - 1991
- [j27]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) - [c18]Amiya Nayak, Nicola Santoro:
Bounds on Performance of VLSI Processor Arrays. IPPS 1991: 364-370 - [c17]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112 - [e6]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. Lecture Notes in Computer Science 519, Springer 1991, ISBN 3-540-54343-0 [contents] - [e5]Jan van Leeuwen, Nicola Santoro:
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings. Lecture Notes in Computer Science 486, Springer 1991, ISBN 3-540-54099-7 [contents] - 1990
- [j26]M. D. Atkinson, Alberto Negro, Nicola Santoro:
Sums of lexicographically ordered sets. Discret. Math. 80(2): 115-122 (1990) - [c16]Amiya Nayak, Nicola Santoro, Richard Tan:
Fault-intolerance of reconfigurable systolic arrays. FTCS 1990: 202-209 - [c15]Nicola Santoro, Peter Widmayer:
Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms 1990: 358-367
1980 – 1989
- 1989
- [j25]Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks:
Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) - [j24]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Partial Orders. SIAM J. Discret. Math. 2(2): 245-254 (1989) - [j23]Nicola Santoro, Ed Suen:
Reduction Techniques for Selection in Distributed Files. IEEE Trans. Computers 38(6): 891-896 (1989) - [c14]Mark H. Overmars, Nicola Santoro:
TIME vs BITS. STACS 1989: 282-293 - [c13]Nicola Santoro, Peter Widmayer:
Time is Not a Healer. STACS 1989: 304-313 - [e4]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. Lecture Notes in Computer Science 382, Springer 1989, ISBN 3-540-51542-9 [contents] - 1988
- [j22]M. D. Atkinson, Nicola Santoro:
A Practical Algorithm for Boolean Matrix Multiplication. Inf. Process. Lett. 29(1): 37-38 (1988) - [j21]Nicola Santoro, Michael Scheutzow, Jeffrey B. Sidney:
On the Expected Complexity of Distributed Selection. J. Parallel Distributed Comput. 5(2): 194-203 (1988) - [c12]Nicola Santoro, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment, Common Roots of Polynomials and Partial Orders. STACS 1988: 292-300 - [c11]Nicola Santoro:
(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models. WG 1988: 180-189 - 1987
- [j20]Doron Rotem, Ephraim Korach, Nicola Santoro:
Analysis of a Distributed Algorithm for Extrema Finding in a Ring. J. Parallel Distributed Comput. 4(6): 575-591 (1987) - [j19]Selim G. Akl, Nicola Santoro:
Optimal Parallel Merging and Sorting Without Memory Conflicts. IEEE Trans. Computers 36(11): 1367-1369 (1987) - [j18]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Vector Dominance. Theor. Comput. Sci. 53: 345-352 (1987) - [c10]Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356 - [c9]Ekow J. Otoo, Nicola Santoro, Doron Rotem:
Improving Semi-Join Evaluation in Distributed Query Processing. ICDCS 1987: 554-561 - [c8]Frank K. H. A. Dehne, Nicola Santoro:
Optimal VLSI Dictionary Machines on Meshes. ICPP 1987: 832-840 - [c7]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 - [c6]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
On the Expected Complexity of Distributed Selection. STACS 1987: 456-467 - [c5]Alberto Negro, Nicola Santoro, Jorge Urrutia:
On the Packet Complexity of Distributed Selection. WDAG 1987: 108-115 - 1986
- [j17]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) - [j16]Nicola Santoro, Jorge Urrutia:
An improved algorithm for Boolean matrix multiplication. Computing 36(4): 375-382 (1986) - [j15]Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia:
Uniquely colourable m-dichromatic oriented graphs. Discret. Math. 62(1): 65-70 (1986) - [j14]Doron Rotem, Nicola Santoro, Jeffrey B. Sidney:
Shout echo selection in distributed files. Networks 16(1): 77-86 (1986) - [j13]Mike D. Atkinson, Nicola Santoro, Jorge Urrutia:
On the integer complexity of Boolean matrix multiplication. SIGACT News 18(1): 53 (1986) - [j12]Michael D. Atkinson, Nicola Santoro, Jorge Urrutia:
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. IEEE Trans. Commun. 34(6): 614-617 (1986) - [c4]Greg N. Frederickson, Nicola Santoro:
Breaking Symmetry in Synchronous Networks. Aegean Workshop on Computing 1986: 26-33 - [c3]Nicola Santoro, Ed Suen:
Reduction Techniques for Selection in Distributed Files. ICPP 1986: 1003-1009 - 1985
- [j11]Nicola Santoro, Ramez Khatib:
Labelling and Implicit Routing in Networks. Comput. J. 28(1): 5-8 (1985) - [j10]Nicola Santoro, Jeffrey B. Sidney:
Interpolation-Binary Search. Inf. Process. Lett. 20(4): 179-181 (1985) - [j9]Nicola Santoro:
The un-merging problem. SIGACT News 17(1): 5-6 (1985) - [j8]Doron Rotem, Nicola Santoro, Jeffrey B. Sidney:
Distributed Sorting. IEEE Trans. Computers 34(4): 372-376 (1985) - [c2]Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance. STACS 1985: 322-327 - 1984
- [j7]Nicola Santoro:
Chain Multiplication of Matrices of Approximately or Exactly the Same Size. Commun. ACM 27(2): 152-156 (1984) - [j6]Nicola Santoro:
On the message complexity of distributed problems. Int. J. Parallel Program. 13(3): 131-147 (1984) - [j5]Nicola Santoro:
Sense of direction, topological awareness and communication complexity. SIGACT News 16(2): 50-56 (1984) - [j4]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) - [e3]Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro:
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984. ACM 1984, ISBN 0-89791-143-1 [contents] - 1983
- [e2]Robert L. Probert, Nancy A. Lynch, Nicola Santoro:
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17-19, 1983. ACM 1983, ISBN 0-89791-110-5 [contents] - 1982
- [e1]Robert L. Probert, Michael J. Fischer, Nicola Santoro:
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, August 18-20, 1982. ACM 1982, ISBN 0-89791-081-8 [contents] - 1980
- [j3]Nicola Santoro:
Extending the Four Russians' Bound to General Matrix Multiplication. Inf. Process. Lett. 10(2): 87-88 (1980)
1970 – 1979
- 1979
- [c1]Raúl J. Ramírez, Nicola Santoro:
Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm. Berkeley Workshop 1979: 191- - 1976
- [j2]Nicola Santoro:
Full Table Search by Polynomial Functions. Inf. Process. Lett. 5(3): 72-74 (1976) - [j1]Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Random access in a list environment. Inf. Syst. 2(1): 11-17 (1976)
Coauthor Index
[j121] [c184] [i29] [i28] [j119] [j118] [c182] [c181] [c180] [i27] [i26] [j117] [c179] [c178] [c177] [i25] [j115] [j114] [c175] [c174] [j113] [j112] [j111] [j110] [j109] [j108] [j106] [c172] [c171] [c170] [i23] [i22] [i21] [j105] [c168] [c167] [c166] [c165] [c164] [c163] [p4] [e15] [i20] [c161] [c160] [c159] [c158] [j104] [j103] [c157] [c156] [c155] [c154] [c153] [c152] [c151] [i19] [i18] [i17] [i16] [i15] [j101] [j100] [j99] [j98] [c150] [c148] [c147] [i14] [i13] [i12] [j97] [j96] [j95] [c146] [c144] [i11] [i10] [j94] [j93] [c143] [c142] [c140] [c139] [c138] [i9] [i8] [j92] [j91] [j90] [c136] [c135] [c134] [c133] [i7] [b2] [j89] [j88] [j87] [j86] [j85] [j84] [c131] [c130] [c129] [c128] [c127] [p2] [i6] [i5] [i4] [j83] [j82] [j81] [c126] [c124] [c123] [c122] [p1] [i3] [j75] [c120] [c119] [c118] [c115] [c113] [i2] [j74] [c111] [c110] [c109] [i1] [j71] [j68] [j67] [c103] [c100] [c99] [j66] [j63] [j61] [c98] [c94] [c93] [j60] [j59] [j58] [c88] [c86] [c85] [c82] [c80] [j57] [c72] [j56] [j54] [c69] [c68] [c66] [c65] [c64] [j52] [j51] [j50] [j49] [c63] [c61] [c60] [c59] [c57] [c56] [c55] [j47] [c53] [c50] [c49] [c48] [c46] [c45] [c44] [c43] [c42] [c39] [j44] [j43] [j41] [c38] [c37] [j38] [j36] [c35] [c34] [j33] [c29] [c28] [e9] [c24] [c23] [c22]
Rastislav Kralovic
aka: Rastislav Královic
aka: Rastislav Královic
[j121] [j120] [i29] [j119] [c181] [c175] [c173] [i24] [j113] [j106] [i22] [p4] [e15] [c160] [j104] [c154] [i19] [i16] [j100] [c150] [c142] [c140] [i8] [b2] [j85] [j84] [c130] [p1] [j71] [j68] [j67] [j66] [c98] [j60] [j59] [j58] [c88] [c83] [j57] [c69] [c66] [c63] [c61] [c57] [c56] [c53] [c50] [c49] [c45]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
