Ivan Rapaport
Orcid: 0000-0002-2969-5083
According to our database1,
Ivan Rapaport
authored at least 68 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
Int. J. Parallel Emergent Distributed Syst., 2023
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the Structural Information and Communication Complexity, 2023
2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.
Proceedings of the Structural Information and Communication Complexity, 2022
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022
Proceedings of the Automata and Complexity, 2022
2021
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality.
Nat. Comput., 2021
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021
2020
SIAM J. Discret. Math., 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2019
Proceedings of the Structural Information and Communication Complexity, 2019
2018
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
Proceedings of the Structural Information and Communication Complexity, 2018
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
2016
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model.
Networks, 2016
Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case.
Biosyst., 2016
Proceedings of the Distributed Computing - 30th International Symposium, 2016
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Comput., 2015
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model.
Proceedings of the Structural Information and Communication Complexity, 2015
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
2014
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism.
Proceedings of the Structural Information and Communication Complexity, 2014
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014
2013
Theor. Comput. Sci., 2013
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata.
Theor. Comput. Sci., 2013
2012
Theor. Comput. Sci., 2012
Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012
2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21].
Theor. Comput. Sci., 2011
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
CoRR, 2011
Algorithmica, 2011
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
2010
Average long-lived binary consensus: Quantifying the stabilizing role played by memory.
Theor. Comput. Sci., 2010
Proceedings of the Structural Information and Communication Complexity, 2010
2009
2008
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.
Proceedings of the Structural Information and Communication Complexity, 2008
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
2007
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
2006
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006
2004
Theor. Comput. Sci., 2004
J. Graph Theory, 2004
2003
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
2001
1999
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results.
Discret. Math., 1999
Discret. Appl. Math., 1999
1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997