Sciweavers

51 search results - page 10 / 11
» algorithmica 2010
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 5 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 5 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
ALGORITHMICA
2010
152views more  ALGORITHMICA 2010»
13 years 5 months ago
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
We study the equilibrium behavior of informed traders interacting with market scoring rule (MSR) market makers. One attractive feature of MSR is that it is myopically incentive com...
Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M...
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 6 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
JDA
2010
131views more  JDA 2010»
13 years 3 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi