Sciweavers

SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
13 years 3 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 3 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
13 years 3 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
CORR
1999
Springer
120views Education» more  CORR 1999»
13 years 3 months ago
A Machine-Independent Debugger--Revisited
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
David R. Hanson
INFORMATICALT
2002
103views more  INFORMATICALT 2002»
13 years 3 months ago
Numerical Representations as Purely Functional Data Structures: a New Approach
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...
Mirjana Ivanovic, Viktor Kuncak
EWC
2002
90views more  EWC 2002»
13 years 3 months ago
An Efficient Adaptive Procedure for Three-Dimensional Fragmentation Simulations
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulation...
Anna Pandolfi, Michael Ortiz
JACM
2000
131views more  JACM 2000»
13 years 3 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
CGF
2002
116views more  CGF 2002»
13 years 3 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 3 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard