( en | de | ru )

 

Disambiguation of "Peleg, David"

Author of the publication

copydeleteadd this publication to your clipboard
Efficiently Realizing Interval Sequences.

, , , and . SIAM J. Discret. Math., 34 (4): 2318-2337 (2020)

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.

Ika Peleg

Shahaf Peleg

Gabriel Pelegrina Bonilla

Milton Pelegrini

Wahyudi David

 

Other publications of authors with the same name

MST construction in O(log log n) communication rounds., , , and . SPAA, page 94-100. ACM, (2003)Wireless Expanders., , , and . SPAA, page 13-22. ACM, (2018)Competitive Distributed Job Scheduling (Extended Abstract), , and . STOC, page 571-580. ACM, (1992)Feasibility and complexity of broadcasting with random transmission failures., and . PODC, page 334-341. ACM, (2005)Compact Routing Schemes with Low Stretch Factor (Extended Abstract)., , and . PODC, page 11-20. ACM, (1998)Maintaining Communication in Multi-Robot Tree Coverage., , , , and . IJCAI, page 4515-4522. ijcai.org, (2017)Labeling Schemes for Weighted Dynamic Trees., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 369-383. Springer, (2003)Low Stretch Spanning Trees.. MFCS, volume 2420 of Lecture Notes in Computer Science, page 68-80. Springer, (2002)Approximation Algorithm for Hotlink Assignments in Web Directories., and . WADS, volume 2748 of Lecture Notes in Computer Science, page 271-280. Springer, (2003)The Average Hop Count Measure for Virtual Path Layouts., and . DISC, volume 2180 of Lecture Notes in Computer Science, page 255-269. Springer, (2001)