Sciweavers

1456 search results - page 45 / 292
» An Overview of the SODA System
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 5 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
SODA
2010
ACM
426views Algorithms» more  SODA 2010»
14 years 5 months ago
Shape Replication Through Self-Assembly and RNase Enzymes
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...
Zachary Abel, Nadia Benbernou, Mirela Damian, Erik...
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
13 years 9 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 9 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
VOSS
2004
Springer
125views Mathematics» more  VOSS 2004»
14 years 28 days ago
Probabilistic Automata: System Types, Parallel Composition and Comparison
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
Ana Sokolova, Erik P. de Vink