Maintaining order in a generalized linked list
Acta Informatica
Data structures and network algorithms
Data structures and network algorithms
Information and Control
Planar point location using persistent search trees
Communications of the ACM
Searching and sorting similar lists
Journal of Algorithms
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fractional Cascading: A Data Structuring Technique with Geometric Applications
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Proceedings of the 5th GI-Conference on Theoretical Computer Science
AVL-Trees for Localized Search
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Efficient applicative data types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Persistent data structures
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
I-structures: data structures for parallel computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multidimensional Balanced Binary Trees
IEEE Transactions on Computers
Hidden surface removal for rectangles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Stores and partial continuations as first-class objects in a language and its environment
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Scheduling parallelizable tasks: putting it all on the shelf
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Future directions in program transformations
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
ACM Transactions on Programming Languages and Systems (TOPLAS)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Compact interval trees: a data structure for convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
Clustering Techniques for Minimizing External Path Length
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Programming Languages For Interactive Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Versioning Tree Structures by Path-Merging
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
New Data Structures for IP Lookup and Conflict Detection
Algorithmics of Large and Complex Networks
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
An introductory tutorial on JastAdd attribute grammars
GTTSE'09 Proceedings of the 3rd international summer school conference on Generative and transformational techniques in software engineering III
Kopitiam: modular incremental interactive full functional static verification of java code
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Stratified B-trees and versioned dictionaries
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
First-order interactive programming
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Banshee: a scalable constraint-based analysis toolkit
SAS'05 Proceedings of the 12th international conference on Static Analysis
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Exploring storage class memory with key value stores
Proceedings of the 1st Workshop on Interactions of NVM/FLASH with Operating Systems and Workloads
| Hi-index | 0.00 |