Sciweavers

Share
CORR
2011
Springer
215views Education» more  CORR 2011»
8 years 4 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
SBMF
2010
Springer
149views Formal Methods» more  SBMF 2010»
8 years 5 months ago
Reasoning about Assignments in Recursive Data Structures
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
Alejandro Tamalet, Ken Madlener
CORR
2011
Springer
173views Education» more  CORR 2011»
8 years 5 months ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
CODES
2010
IEEE
8 years 7 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem
FECS
2009
172views Education» more  FECS 2009»
8 years 8 months ago
Using Interface Inheritance to Structure the Data Structures Course
Traditional instruction in the first data structures course treats object-oriented inheritance and polymorphism as isolated topics if at all. Course organization is an exploration...
Dale Parson, Daniel Spiegel
DATESO
2009
158views Database» more  DATESO 2009»
8 years 8 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
8 years 8 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
SIGSOFT
2010
ACM
8 years 8 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
8 years 8 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
SPIRE
2010
Springer
8 years 8 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro
books