Implementing deletion in B+-trees
ACM SIGMOD Record
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Optimizing Jan Jannink's Implementation of B+-tree deletion
ACM SIGMOD Record
ACM Computing Surveys (CSUR)
Approximate symmetry detection for reverse engineering
Proceedings of the sixth ACM symposium on Solid modeling and applications
Multi-objective abstract data type refinement for mapping tables in telecom network applications
Proceedings of the 2002 workshop on Memory system performance
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
An almost linear-time algorithm for trapezoidation of GIS polygons
Future Generation Computer Systems - Special issue: Geocomputation
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Journal of Systems Architecture: the EUROMICRO Journal
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Journal of Systems and Software
Algorithms and theory of computation handbook
Sorting algorithms as special cases of a priority queue sort
Proceedings of the 42nd ACM technical symposium on Computer science education
Derick wood: always in our hearts
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Dynamic data type optimization and memory assignment methodologies
PATMOS'09 Proceedings of the 19th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.02 |