Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Parallel algorithms for arrangements
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Unique binary search tree representations and equality-testing of sets and sequences
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
INC: a language for incremental computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Algorithms for subset testing and finding maximal sets
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A randomized implementation of multiple functional arrays
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Fully persistent lists with catenation
Journal of the ACM (JACM)
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
The treatment of state in optimistic systems
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The role of lazy evaluation in amortized data structures
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A probabilistic approach to the problem of automatic selection of data representations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Functional programming with graphs
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
On-line approximate list indexing with applications
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Isomorphism testing and display of symmetries in dynamic trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Clustering for faster network simplex pivots
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Maintaining dynamic sequences under equality-tests in polylogarithmic time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
A persistent runtime system using persistent data structures
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Segment intersection searching problems in general settings
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Adaptive functional programming
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Optimal finger search trees in the pointer machine
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient integration and aggregation of historical information
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
A Persistent Store for Large Shared Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The BT-tree: A Branched and Temporal Access Method
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Time and Space Efficient Multi-method Dispatching
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
2-D Spatial Indexing Scheme in Optimal Time
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Multiversion Linear Quadtree for Spatio-Temporal Data
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Intersecting Red and Blue Line Segments in Optimal Time and Precision
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Exponentially Decreasing Number of Operations in Balanced Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
2D-Structure Drawings of Similar Molecules
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Efficient schemes for managing multiversionXML documents
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Translating a regular grid over a point set
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Pursuing a Petaflop: Point Designs for 100 TF Computers Using PIM Technologies
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Journal of Computer and System Sciences - Special issue on PODS 2000
A time-evolving data structure scalable between discrete and continuous attribute modifications
Computer Science in Perspective
An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences - STOC 2002
Journal of Functional Programming
Inductive benchmarking for purely functional data structures
Journal of Functional Programming
A new method for functional arrays
Journal of Functional Programming
ACM Transactions on Database Systems (TODS)
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
Time-varying reeb graphs for continuous space-time data
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
New dynamic balanced search trees with worst-case constant update time
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
An infrastructure for development of object-oriented, multi-level configuration management services
Proceedings of the 27th international conference on Software engineering
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Transformational Derivation of an Improved Alias Analysis Algorithm
Higher-Order and Symbolic Computation
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
A delta-driven execution model for semantic computing
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Finger trees: a simple general-purpose data structure
Journal of Functional Programming
PersiFS: a versioned file system with an efficient representation
Proceedings of the twentieth ACM symposium on Operating systems principles
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Improved output-sensitive snap rounding
Proceedings of the twenty-second annual symposium on Computational geometry
Lower and upper bounds on obtaining history independence
Information and Computation
Dynamic state restoration using versioning exceptions
Higher-Order and Symbolic Computation
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Adaptive functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Range mode and range median queries on lists and trees
Nordic Journal of Computing
ACM Transactions on Algorithms (TALG)
Component-based version management for embedded computing system design
Proceedings of the 2007 ACM symposium on Applied computing
Tight bounds for dynamic convex hull queries (again)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A transactional flash file system for microcontrollers
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Purely functional worst case constant time catenable sorted lists
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Summarizing data using bottom-k sketches
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Strong accountability for network storage
ACM Transactions on Storage (TOS)
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Time-varying Reeb graphs for continuous space--time data
Computational Geometry: Theory and Applications
Confluently Persistent Tries for Efficient Version Control
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
A dynamic data structure for top-k queries on uncertain data
Theoretical Computer Science
Worst-case efficient range search indexing: invited tutorial
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Executing code in the past: efficient in-memory object graph versioning
Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications
Executing code in the past: efficient in-memory object graph versioning
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Lower and upper bounds on obtaining history independence
Information and Computation
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Largest empty circle centered on a query line
Journal of Discrete Algorithms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Dynamic structures for top-k queries on uncertain data
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Persistent data structures for fast point location
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Semi-persistent data structures
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Logging every footstep: quantile summaries for the entire history
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Authentic time-stamps for archival storage
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A time efficient indexing scheme for complex spatiotemporal retrieval
ACM SIGMOD Record
The performance of the Haskell containers package
Proceedings of the third ACM Haskell symposium on Haskell
Cell probe lower bounds and approximations for range mode
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
External-memory algorithms and data structures
Algorithms and theory of computation handbook
An abstract machine for the old value retrieval
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Consistent and durable data structures for non-volatile byte-addressable memory
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Efficient top-k queries for orthogonal ranges
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Range-aggregate queries involving geometric aggregation operations
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Proceedings of the twenty-seventh annual symposium on Computational geometry
Dynamic planar range maxima queries
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
How to cover a point set with a V-shape of minimum width
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Persistency in suffix trees with applications to string interval problems
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Possible world partition sequences: a unifying framework for uncertain reasoning
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Confluent persistence revisited
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient maintenance of ephemeral data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Efficient non-intersection queries on aggregated geometric data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximate range mode and range median queries
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An efficient exact algorithm for the minimum ultrametric tree problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient algorithms for the weighted k-center problem on a real line
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Formalized verification of snapshotable trees: separation and sharing
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
History-independence: a fresh look at the case of R-trees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
JANUS: exploiting parallelism via hindsight
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Verification of snapshotable trees using access permissions and typestate
TOOLS'12 Proceedings of the 50th international conference on Objects, Models, Components, Patterns
Simple and efficient LZW-Compressed multiple pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
From surveys to collaborative art: enabling children to program with online data
Proceedings of the 12th International Conference on Interaction Design and Children
Colored top-K range-aggregate queries
Information Processing Letters
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Compressed persistent index for efficient rank/select queries
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Simple and efficient LZW-compressed multiple pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |