Taisuke Izumi

Daisuke Suzuki

IEICE Trans. Inf. Syst., 2015

Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions.

[BibT_eX]

[DOI]

Hirotaka Ono

CoRR, 2015

Improving Lower Bound on Opaque Set for Equilateral Triangle.

[BibT_eX]

[DOI]

CoRR, 2015

Filling Logarithmic Gaps in Distributed Complexity for Global Problems.

[BibT_eX]

[DOI]

Hiroaki Ookawa

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

On Space and Time Complexity of Loosely-Stabilizing Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions.

[BibT_eX]

[DOI]

Hirotaka Ono

Proceedings of the IEEE International Symposium on Information Theory, 2015

Listing Center Strings Under the Edit Distance Metric.

[BibT_eX]

[DOI]

Hiromitsu Maji

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Space-efficient self-stabilizing counting population protocols on mobile sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Bitwise MAP Algorithm for Group Testing based on Holographic Transformation.

[BibT_eX]

[DOI]

CoRR, 2014

On the Worst-Case Initial Configuration for Conservative Connectivity Preservation.

[BibT_eX]

[DOI]

Daichi Kaino

Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014

Randomized Lower Bound for Distributed Spanning-Tree Verification.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Time Lower Bounds for Distributed Distance Oracles.

[BibT_eX]

[DOI]

Roger Wattenhofer

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Depth-First Search Using O(n) Bits.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Investigating the Effectiveness of a Moving-Target Oriented Opportunistic Routing Algorithm on RoboCup Rescue Simulations.

[BibT_eX]

[DOI]

Proceedings of the IIAI 3rd International Conference on Advanced Applied Informatics, 2014

2013

Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2013

Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Scalable Estimation of Network Average Degree.

[BibT_eX]

[DOI]

Hironobu Kanzaki

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

When Expanders Help Self-Healing Distributed R-Tree Overlays.

[BibT_eX]

[DOI]

Maria Potop-Butucaru

Mathieu Valero

Proceedings of the IEEE 12th International Symposium on Parallel and Distributed Computing, 2013

2012

The optimal tolerance of uniform observation error for mobile robot convergence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the approximability and hardness of minimum topic connected overlay and its special instances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling.

[BibT_eX]

[DOI]

Fukuhito Ooshita

Tomoko Izumi

Parallel Process. Lett., 2012

How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.

[BibT_eX]

[DOI]

Shukai Cai

Theory Comput. Syst., 2012

Minimum Certificate Dispersal with Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

A New Direction for Counting Perfect Matchings.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Oracle-based flocking of mobile robots in crash-recovery model.

[BibT_eX]

[DOI]

Samia Souissi

Theor. Comput. Sci., 2011

Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems.

[BibT_eX]

[DOI]

Nazreen Banu

Parallel Process. Lett., 2011

The BG-simulation for Byzantine Mobile Robots

[BibT_eX]

[DOI]

CoRR, 2011

Emergent velocity agreement in robot networks

[BibT_eX]

[DOI]

CoRR, 2011

Physical Expander in Virtual Tree Overlay.

[BibT_eX]

[DOI]

Maria Gradinariu Potop-Butucaru

Mathieu Valero

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Distributed Algorithms for Cooperative Mobile Robots: A Survey.

[BibT_eX]

[DOI]

Samia Souissi

Maria Gradinariu Potop-Butucaru

Proceedings of the Second International Conference on Networking and Computing, 2011

2010

Approximability and inapproximability of the minimum certificate dispersal problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The cost of probabilistic agreement in oblivious robot networks.

[BibT_eX]

[DOI]

Julien Clément

Xavier Défago

Stéphane Messika

Inf. Process. Lett., 2010

Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility.

[BibT_eX]

[DOI]

Maria Gradinariu Potop-Butucaru

Sébastien Tixeuil

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Doubly-expedited one-step Byzantine consensus.

[BibT_eX]

[DOI]

Nazreen Banu

Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, 2010

2009

A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

A Biologically Inspired Self-Adaptation of Replica Density Control.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Randomized Gathering of Mobile Robots with Local-Multiplicity Detection.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

Convergence of Mobile Robots with Uniformly-Inaccurate Sensors.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents.

[BibT_eX]

[DOI]

Shukai Cai

Proceedings of the Structural Information and Communication Complexity, 2009

A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines.

[BibT_eX]

[DOI]

Fukuhito Ooshita

Tomoko Izumi

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Move-optimal gossiping among mobile agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2008

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Construction of Loosely-Structured Overlay Using Bloom Filter.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

2007

Adaptive timeliness of consensus in presence of crash and timing faults.

[BibT_eX]

[DOI]

Akinori Saitoh

J. Parallel Distributed Comput., 2007

Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2007

Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Probabilistic Omission Adversary.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

Optimal Moves for Gossiping Among Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

An adaptive randomized search protocol in peer-to-peer systems.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

2006

Condition Adaptation in Synchronous Consensus.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

One-Step Consensus Solvability.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2006

Bio-inspired Replica Density Control in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

An Interest-Based Peer Clustering Algorithm Using Ant Paradigm.

[BibT_eX]

[DOI]

Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

2005

Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2005

An Improved Algorithm for Adaptive Condition-Based Consensus.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Autonomic Computing (ICAC 2005), 2005

Biologically Inspired Self-Adaptation of Mobile Agent Population.

[BibT_eX]

[DOI]

Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA 2005), 2005

2004

Synchronous Condition-Based Consensus Adapting to Input-Vector Legality.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

Timed Uniform Consensus Resilient to Crash and Timing Faults.

[BibT_eX]

[DOI]

Akinori Saitoh

Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

Ant-Based Approach to Mobile Agent Traversal.

[BibT_eX]

[DOI]