Sciweavers

32545 search results - page 29 / 6509
» Data Structures and Algorithms
Sort
View
ESORICS
2009
Springer
14 years 9 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
PODC
2010
ACM
14 years 12 days ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 10 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
GECCO
2003
Springer
106views Optimization» more  GECCO 2003»
14 years 1 months ago
Taming a Flood with a T-CUP - Designing Flood-Control Structures with a Genetic Algorithm
This paper describes the use of a genetic algorithm to solve a hydrology design problem - determining an optimal or near-optimal prescription of Best Management Practices in a flo...
Jeff Wallace, Sushil J. Louis
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
14 years 22 days ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen