General Compact Labeling Schemes for Dynamic Trees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Amos Korman. General Compact Labeling Schemes for Dynamic Trees. In Pierre Fraigniaud, editor, Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings. Volume 3724 of Lecture Notes in Computer Science, pages 457-471, Springer, 2005. [doi]

The following publications are possibly variants of this publication:

General compact labeling schemes for dynamic treesAmos Korman. dc, 20(3):179-193, 2007. [doi]

Compact separator decompositions in dynamic trees and applications to labeling schemesAmos Korman, David Peleg. dc, 21(2):141-161, 2008. [doi]

Compact Separator Decompositions in Dynamic Trees and Applications to Labeling SchemesAmos Korman, David Peleg. wdag 2007: 313-327 [doi]

Compact Ancestry Labeling Schemes for XML TreesPierre Fraigniaud, Amos Korman. soda 2010: 458-466 [doi]

Labeling schemes for weighted dynamic treesAmos Korman, David Peleg. iandc, 205(12):1721-1740, 2007. [doi]

Labeling Schemes for Dynamic Tree NetworksAmos Korman, David Peleg, Yoav Rodeh. mst, 37(1):49-75, 2004. [doi]

Labeling Schemes for Weighted Dynamic TreesAmos Korman, David Peleg. icalp 2003: 369-383 [doi]

Labeling Schemes for Dynamic Tree NetworksAmos Korman, David Peleg, Yoav Rodeh. STACS 2002: 76-87 [doi]

runs on WebDSL