Sciweavers

Share
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
9 years 11 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
9 years 11 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
9 years 11 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
9 years 11 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
9 years 11 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
9 years 11 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
9 years 11 months ago
Computing large matchings fast
Ignaz Rutter, Alexander Wolff
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
9 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
9 years 11 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
9 years 11 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige
books