Person:557817: Difference between revisions

From MaRDI portal
Person:557817
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Nicola Santoro to Nicola Santoro: Duplicate
 
(No difference)

Latest revision as of 09:01, 9 December 2023

Available identifiers

zbMath Open santoro.nicolaDBLPs/NicolaSantoroWikidataQ102244295 ScholiaQ102244295MaRDI QIDQ557817

List of research outcomes

PublicationDate of PublicationType
Separating Bounded and Unbounded Asynchrony for Autonomous Robots2024-03-26Paper
(Time × space)-efficient implementations of hlerarchical conceptual models2024-02-28Paper
Cops \& robber on periodic temporal graphs: characterization and improved bounds2024-01-11Paper
Copnumbers of periodic graphs2023-10-20Paper
On the complexity of testing for catastrophic faults2023-03-21Paper
Tight bounds on distributed exploration of temporal graphs2023-02-07Paper
Oblivious Permutations on the Plane2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58742582023-02-07Paper
Gathering and Election by Mobile Robots in a Continuous Cycle.2023-02-03Paper
Meeting in a polygon by anonymous oblivious robots2023-02-03Paper
Time vs bits2022-08-16Paper
Time is not a healer2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50909102022-07-21Paper
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications2022-04-01Paper
On synchronization and orientation in distributed barrier coverage with relocatable sensors2021-09-27Paper
Exploration of dynamic networks: tight bounds on the number of agents2021-09-17Paper
Line reconfiguration by programmable particles maintaining connectivity2021-07-06Paper
Fault-tolerant simulation of population protocols2021-01-22Paper
Distributed computing on oriented anonymous hypercubes with faulty components2020-12-03Paper
Meeting in a polygon by anonymous oblivious robots2020-10-16Paper
Shape formation by programmable particles2020-07-30Paper
Distributed exploration of dynamic rings2020-04-21Paper
Shape formation by programmable particles2020-04-21Paper
Gathering in dynamic rings2020-02-13Paper
Population protocols with faulty interactions: the impact of a leader2018-12-04Paper
Uniform dispersal of asynchronous finite-state mobile robots in presence of holes2018-10-17Paper
On the Microscopic View of Time and Messages2018-10-04Paper
Optimal elections in faulty loop networks and applications2018-07-09Paper
Efficient parallel graph algorithms for coarse grained multicomputers and BSP2018-07-04Paper
Gathering in dynamic rings2018-04-12Paper
Distributed computing by mobile robots: uniform circle formation2017-11-29Paper
Time to Change: On Distributed Computing in Dynamic Networks (Keynote)2017-09-29Paper
Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks2017-08-08Paper
Efficient, Decentralized Computation of the Topology of Spatial Regions2017-07-27Paper
Population protocols with faulty interactions: the impact of a leader2017-07-21Paper
A Rupestrian Algorithm.2017-07-17Paper
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures2017-07-12Paper
Measuring Temporal Lags in Delay-Tolerant Networks2017-06-20Paper
Mediated Population Protocols: Leader Election and Applications2017-05-19Paper
Mutual visibility by luminous robots without collisions2017-05-12Paper
Universal Systems of Oblivious Mobile Robots2016-12-01Paper
On the impact of sense of direction on message complexity2016-05-26Paper
Rendezvous with constant memory2016-02-26Paper
Network decontamination under \(m\)-immunity2016-02-04Paper
Exploring an unknown dangerous graph with a constant number of tokens2015-12-10Paper
Autonomous mobile robots with lights2015-12-08Paper
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks2015-09-29Paper
Backward consistency and sense of direction in advanced distributed systems2015-09-11Paper
Forming sequences of geometric patterns with oblivious mobile robots2015-07-08Paper
On the expressivity of time-varying graphs2015-06-10Paper
TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION2015-04-29Paper
On the computational power of oblivious robots2015-03-02Paper
Brief announcement2014-12-05Paper
Distributed Barrier Coverage with Relocatable Sensors2014-08-07Paper
Searching for a black hole in arbitrary networks2014-07-25Paper
Rendezvous of Two Robots with Constant Memory2013-12-17Paper
Expressivity of Time-Varying Graphs2013-08-16Paper
Computing without communicating: ring exploration by asynchronous oblivious robots2013-08-05Paper
Searching for a black hole in arbitrary networks: optimal mobile agents protocols2013-06-20Paper
Optimal Network Decontamination with Threshold Immunity2013-06-07Paper
How many oblivious robots can explore a line2013-04-04Paper
Exploring an unknown dangerous graph using tokens2013-03-04Paper
On the exploration of time-varying networks2013-02-19Paper
Searching for black holes in subways2012-12-06Paper
Distributed Computing by Mobile Robots: Gathering2012-11-29Paper
Connected graph searching2012-11-27Paper
TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS2012-08-27Paper
Computing all the best swap edges distributively2012-07-26Paper
Ping pong in dangerous graphs: optimal black hole search with pebbles2012-04-26Paper
UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID2011-05-10Paper
Computing by Mobile Robotic Sensors2011-04-05Paper
Time Optimal Algorithms for Black Hole Search in Rings2011-01-10Paper
Network Exploration by Silent and Oblivious Robots2010-11-16Paper
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility2010-10-27Paper
Remembering without memory: tree exploration by asynchronous oblivious robots2010-04-06Paper
Graph-Theoretic Concepts in Computer Science2010-01-12Paper
Exploration of Periodically Varying Graphs2009-12-17Paper
Fault-tolerant sequential scan2009-09-18Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
On Fractional Dynamic Faults with Threshold2009-03-12Paper
USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS2009-02-26Paper
Tree Decontamination with Temporary Immunity2009-01-29Paper
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments2009-01-22Paper
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens2008-11-20Paper
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots2008-11-18Paper
Groupings and Pairings in Anonymous Networks2008-09-09Paper
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links2008-09-02Paper
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree2008-09-02Paper
Self-deployment of mobile sensors on a ring2008-08-14Paper
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots2008-07-10Paper
On fractional dynamic faults with thresholds2008-06-24Paper
Effective Elections for Anonymous Mobile Agents2008-04-24Paper
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents2007-11-15Paper
Map construction of unknown graphs by multiple agents2007-10-18Paper
Agreement in synchronous networks with ubiquitous faults2007-10-02Paper
Mobile search for a black hole in an anonymous ring2007-07-19Paper
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY2007-06-05Paper
Rendezvous and election of mobile agents: Impact of sense of direction2007-02-14Paper
Design and Analysis of Distributed Algorithms2007-01-15Paper
Efficient token-based control in rings.2006-01-17Paper
Principles of Distributed Systems2005-12-15Paper
Structural Information and Communication Complexity2005-11-30Paper
Structural Information and Communication Complexity2005-11-30Paper
Preface: Fun with algorithms2005-09-27Paper
Structural Information and Communication Complexity2005-09-07Paper
Structural Information and Communication Complexity2005-09-07Paper
Principles of Distributed Systems2005-08-24Paper
Gathering of asynchronous robots with limited visibility2005-06-30Paper
https://portal.mardi4nfdi.de/entity/Q46734022005-04-29Paper
On time versus size for monotone dynamic monopolies in regular topologies2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44739762004-08-04Paper
Dynamic monopolies in tori.2004-03-14Paper
Sorting and election in anonymous asynchronous rings.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44492502004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44360492003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q44229772003-08-24Paper
Tight bounds for synchronous communication of information using bits and silence2003-07-30Paper
Computing on anonymous networks with sense of direction2003-07-30Paper
Backward Consistency and Sense of Direction in Advanced Distributed Systems2003-06-19Paper
Sense of direction in distributed computing2003-05-14Paper
Sense of direction: Definitions, properties, and classes2002-07-21Paper
Optimal irreversible dynamos in chordal rings2002-01-16Paper
https://portal.mardi4nfdi.de/entity/Q27625102002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27291002001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q27514562001-10-21Paper
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 902000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q49449812000-03-22Paper
Cellular automata in fuzzy backgrounds2000-01-24Paper
https://portal.mardi4nfdi.de/entity/Q38383971998-11-26Paper
Symmetries and sense of direction in labeled graphs1998-11-03Paper
https://portal.mardi4nfdi.de/entity/Q43877321998-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43851721998-04-13Paper
Improved bounds for electing a leader in a synchronous ring1997-05-28Paper
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy1997-02-27Paper
Finding the extrema of a distributed multiset1996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43220741995-03-20Paper
https://portal.mardi4nfdi.de/entity/Q52890741994-10-31Paper
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays1994-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42816551994-09-26Paper
Guarding rectangular art galleries1994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q31395151994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q46947231993-06-29Paper
A distributed selection algorithm and its expected communication complexity1992-09-27Paper
Computational geometry algorithms for the systolic screen1992-06-25Paper
Sums of lexicographically ordered sets1990-01-01Paper
Geometric Containment and Partial Orders1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47307871989-01-01Paper
Efficient elections in chordal ring networks1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37874881988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37948201988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38010681988-01-01Paper
A practical algorithm for Boolean matrix multiplication1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859071987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37874821987-01-01Paper
Geometric containment and vector dominance1987-01-01Paper
Angle orders, regular n-gon orders and the crossing number1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37350861986-01-01Paper
Shout echo selection in distributed files1986-01-01Paper
Min-max heaps and generalized priority queues1986-01-01Paper
An improved algorithm for Boolean matrix multiplication1986-01-01Paper
Uniquely colourable m-dichromatic oriented graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36830991985-01-01Paper
Interpolation-binary search1985-01-01Paper
Distributed Sorting1985-01-01Paper
Labelling and Implicit Routing in Networks1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51862691984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33322371984-01-01Paper
Distributed algorithms for finding centers and medians in networks1984-01-01Paper
Distributed election in a circle without a global sense of orientation1984-01-01Paper
On the message complexity of distributed problems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33418901983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39455841982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33197621982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452571981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38802801980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38984271980-01-01Paper
Extending the four Russians' bound to general matrix multiplication1980-01-01Paper
On hash techniques in a paged environment1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39260491978-01-01Paper
Full table search by polynomial functions1976-01-01Paper
Operations on permutations and representation in graph form1976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nicola Santoro