PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Rapaport, Ivan"

Author of the publication

copydeleteadd this publication to your clipboard
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.

, , , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 182-193. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ivan Solonenko University of Stuttgart

Ivan Buntic University of Stuttgart

Sergio Ivan Caceres Castro University of Stuttgart

 

Other publications of authors with the same name

Complexity of Tile Rotation Problems., and . Theor. Comput. Sci., 188 (1-2): 129-159 (1997)Minimal Proper Interval Completions., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 217-228. Springer, (2006)Additive Cellular Automata over Zp and the Bottom of (CA, <=)., and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 834-843. Springer, (1998)Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time., , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 45-56. Springer, (2006)Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round., , , , , and . IPDPS, page 508-514. IEEE, (2011)Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power, , , , and . CoRR, (2011)Adding a referee to an interconnection network: What can(not) be computed in one round, , , , , and . CoRR, (2010)Cellular automata and communication complexity, , and . CoRR, (2002)Complexity of approximating the oriented diameter of chordal graphs., , and . Journal of Graph Theory, 45 (4): 255-269 (2004)Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model., , , and . Networks, 67 (1): 82-91 (2016)