Author of the publication

Implicit B-Trees: New Results for the Dictionary Problem.

, , , and . FOCS, page 145-154. IEEE Computer Society, (2002)

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.

 

Other publications of authors with the same name

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree., , , , and . IFIP TCS, volume 155 of IFIP, page 153-166. Kluwer/Springer, (2004)A Preliminary Study of a Diagonal Channel-Routing Model., , and . Algorithmica, 4 (4): 585-597 (1989)On the Height of Height-Balanced Trees., and . IEEE Trans. Computers, 25 (1): 87-91 (1976)On a New Boolean Function with Applications., and . IEEE Trans. Computers, 48 (3): 296-310 (1999)Network decontamination with local immunization., , and . IPDPS, IEEE, (2006)A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs., and . Inf. Process. Lett., 15 (1): 1-4 (1982)The Fermat star of binary trees., and . Inf. Process. Lett., 109 (11): 568-571 (2009)Exploiting Regularities for Boolean Function Synthesis., , , and . Theory Comput. Syst., 39 (4): 485-501 (2006)Routing in Times Square Mode., , and . Inf. Process. Lett., 35 (1): 41-48 (1990)Lower bounds on the rotation distance of binary trees., , and . Inf. Process. Lett., 110 (21): 934-938 (2010)