Sciweavers

200 search results - page 29 / 40
» ipl 2006
Sort
View
IPL
2000
77views more  IPL 2000»
14 years 9 months ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang
IPL
2002
119views more  IPL 2002»
14 years 9 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
IPL
2002
90views more  IPL 2002»
14 years 9 months ago
Recognition and dualization of disguised bidual Horn functions
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
IPL
2002
95views more  IPL 2002»
14 years 9 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden