Sciweavers

291 search results - page 44 / 59
» Implementation with a bounded action space
Sort
View
66
Voted
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
14 years 11 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
MICS
2010
94views more  MICS 2010»
14 years 8 months ago
Arrangements on Parametric Surfaces I: General Framework and Infrastructure
We introduce a framework for the construction, maintenance, and manipulation of arrangements of curves embedded on certain two-dimensional orientable parametric surfaces in three-d...
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehl...
CN
2007
117views more  CN 2007»
14 years 9 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
126
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 2 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
DAC
2004
ACM
15 years 10 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening