Sciweavers

2899 search results - page 8 / 580
» Dynamic Trees in Practice
Sort
View
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 5 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
DAC
2006
ACM
14 years 8 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
ENTCS
2007
143views more  ENTCS 2007»
13 years 7 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
PPOPP
2010
ACM
14 years 4 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
VLDB
2004
ACM
72views Database» more  VLDB 2004»
14 years 27 days ago
Practical Suffix Tree Construction
Sandeep Tata, Richard A. Hankins, Jignesh M. Patel