Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Amortized efficiency of list update and paging rules
Communications of the ACM
Data structures and network algorithms
Data structures and network algorithms
SIAM Journal on Computing
Sequential access in splay trees takes linear time
Combinatorica
A data structure for dynamic trees
Journal of Computer and System Sciences
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
A Discipline of Programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries
GI - 10. Jahrestagung
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
A locally adaptive data compression scheme
Communications of the ACM
Planar point location using persistent search trees
Communications of the ACM
Rotation distance, triangulations, and hyperbolic geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Application of splay trees to data compression
Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
On the dynamic finger conjecture for splay trees
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
A compendium of key search references
ACM SIGIR Forum
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Adaptive heuristics for binary search trees and constant linkage cost
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On efficient unsuccessful search
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A comparative performance evaluation of write barrier implementation
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
A hierarchical single-key-lock access control using the Chinese remainder theorem
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Splaying a search tree in preorder takes linear time
ACM SIGACT News
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Efficient simulation of caches under optimal replacement with applications to miss characterization
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Simulation through explicit state description and its application to semiconductor fab operation
WSC '92 Proceedings of the 24th conference on Winter simulation
Fishspear: a priority queue algorithm
Journal of the ACM (JACM)
Discrete-event simulation and the event horizon
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Adaptive checkpointing in Time Warp
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Service oriented scheduling in Time Warp
WSC '94 Proceedings of the 26th conference on Winter simulation
Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
The influence of caches on the performance of heaps
Journal of Experimental Algorithmics (JEA)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Conservative circuit simulation on shared-memory multiprocessors
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Discrete-event simulation and the event horizon part 2: event list management
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
GMSim: a tool for compositional GSMP modeling
Proceedings of the 30th conference on Winter simulation
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Using split event sets to form and schedule event combinations in discrete event simulation
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Data structures for traveling salesmen
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Splay trees for data compression
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth 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
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Writing simulations from scratch: Pascal implementations
WSC '87 Proceedings of the 19th conference on Winter simulation
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
On preorder splaying in binary search trees(abstract and references only)
CSC '91 Proceedings of the 19th annual conference on Computer Science
Efficient Execution of Time Warp Programs on Heterogeneous, NOW Platforms
IEEE Transactions on Parallel and Distributed Systems
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Restructuring ordered binary trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Competitive tree-structured dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
System level online power management algorithms
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
Optimizing static calendar queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Alternatives to splay trees with O(log n) worst-case access times
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Performance modeling for fast IP lookups
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Biased dictionaries with fast insert/deletes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Dynamically bypassing copy rule chains in attribute grammars
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Static optimality and dynamic search-optimality in lists and trees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Enhanced word-based block-sorting text compression
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Bootstrapping one-sided flexible arrays
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Journal of Automated Reasoning
Latency effects of system level power management algorithms
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Incremental algorithms for dispatching in dynamically typed languages
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Randomized splay trees: theoretical and experimental results
Information Processing Letters
On list update and work function algorithms
Theoretical Computer Science
Stack Evaluation of Arbitrary Set-Associative Multiprocessor Caches
IEEE Transactions on Parallel and Distributed Systems
A new method for updating and rebalancing tree-type main memory dictionaries
Nordic Journal of Computing
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
GHOST: Fine Granularity Buffering of Indexes
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A New Method for Balancing Binary Search Trees
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Biased Skip Lists for Highly Skewed Access Patterns
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Learning Search Control Knowledge for Equational Theorem Proving
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Platypus: Design and Implementation of a Flexible High Performance Object Store
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
General Splay: A Basic Theory and Calculus
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An Analytical Model of Scheduling for Conservative Parallel Simulation
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Predicting whole-program locality through reuse distance analysis
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
A model for parallel simulation of mobile telecommunication systems
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Single and bulk updates in stratified trees: an amortized and worst-case analysis
Computer Science in Perspective
Parsing Strategies for BWT Compression
DCC '01 Proceedings of the Data Compression Conference
Optimal state-space lumping in Markov chains
Information Processing Letters
A new method for functional arrays
Journal of Functional Programming
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Restructuring ordered binary trees
Journal of Algorithms - Special issue: SODA 2000
Improving time bounds on maximum generalised flow computations by contracting the network
Theoretical Computer Science - Special issue on automata, languages and programming
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On the sequential access theorem and deque conjecture for splay trees
Theoretical Computer Science
A direct algorithm for restricted rotation distance
Information Processing Letters
Performance analysis of BSTs in system software
Proceedings of the joint international conference on Measurement and modeling of computer systems
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Parameterized self-adjusting heaps
Journal of Algorithms
Parallel and distributed simulation: fast cell level ATM network simulation
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Broad-phase collision detection using semi-adjusting BSP-trees
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
Memory access analysis and optimization approaches on splay trees
LCR '04 Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
A 1.5-approximation algorithm for sorting by transpositions and transreversals
Journal of Computer and System Sciences - Special issue on bioinformatics II
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences - Special issue on bioinformatics II
A segmented parallel-prefix VLSI circuit with small delays for small segments
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Encyclopedia of Computer Science
Efficient disk replacement and data migration algorithms for large disk subsystems
ACM Transactions on Storage (TOS)
Javari: adding reference immutability to Java
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Finger trees: a simple general-purpose data structure
Journal of Functional Programming
A Security Analysis of the Internet Chess Club
IEEE Security and Privacy
Theoretical Computer Science
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Large alphabets and incompressibility
Information Processing Letters
Channel based sequential simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
FreeSML: delivering on the open-source simulation language promise
WSC '05 Proceedings of the 37th conference on Winter simulation
Algorithm 856: APPSPACK 4.0: asynchronous parallel pattern search for derivative-free optimization
ACM Transactions on Mathematical Software (TOMS)
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Proteus: virtualization for diversified tamper-resistance
Proceedings of the ACM workshop on Digital rights management
Improving the performance of multidimensional search using fingers
Journal of Experimental Algorithmics (JEA)
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
Nordic Journal of Computing
AI Communications - CASC
An empirical comparison of generators for self similar simulated traffic
Performance Evaluation
A Complexity O(1) priority queue for event driven molecular dynamics simulations
Journal of Computational Physics
Advances on sorting by reversals
Discrete Applied Mathematics
Exploring the duality between skip lists and binary search trees
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Denial of service via algorithmic complexity attacks
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Cdt: a general and efficient container data type library
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
Efficient dynamic dispatching with type slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Local properties of geometric graphs
Computational Geometry: Theory and Applications
Data structures for limited oblivious execution of programs while preserving locality of reference
Proceedings of the 2007 ACM workshop on Digital Rights Management
Software—Practice & Experience
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The cost of offline binary search tree algorithms and the complexity of the request sequence
Theoretical Computer Science
Testing for buffer overflows with length abstraction
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Query Responsive Index Structures
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Information Processing Letters
Effective splaying with restricted rotations
International Journal of Computer Mathematics
Pairing heaps with O(log log n) decrease cost
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The geometry of binary search trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Searching large indexes on tiny devices: optimizing binary search with character pinning
Proceedings of the 14th international conference on Intelligent user interfaces
The Generalized Stable Allocation Problem
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
An Expanded Lateral Interactive Clonal Selection Algorithm and Its Application
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Program locality analysis using reuse distance
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sorting Signed Permutations by Inversions in O(nlogn) Time
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Journal of Experimental Algorithmics (JEA)
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Virtual reuse distance analysis of SPECjvm2008 data locality
PPPJ '09 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java
A Distribution-Sensitive Dictionary with Low Space Overhead
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Rank-Sensitive Priority Queues
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
Decreasing time response of e-Learning platforms by expertise acquisition
EuroIMSA '08 Proceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Efficient data structures and a new randomized approach for sorting signed permutations by reversals
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Structure learning with nonparametric decomposable models
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Optimal self-adjusting trees for dynamic string data in secondary storage
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Comparing integer data structures for 32 and 64 bit keys
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
An improved kernel size for rotation distance in binary trees
Information Processing Letters
Revisiting priority queues for image analysis
Pattern Recognition
Data structures with unpredictable timing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
The longest almost-increasing subsequence
Information Processing Letters
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
A profile-based tool for finding pipeline parallelism in sequential programs
Parallel Computing
Everest: scaling down peak loads through I/O off-loading
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
A web personalizing technique using adaptive data structures: The case of bursts in web visits
Journal of Systems and Software
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Deletion without rebalancing in balanced binary trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Online algorithms for the newsvendor problem with and without censored demands
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
The longest almost-increasing subsequence
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Memory-efficient frequent-itemset mining
Proceedings of the 14th International Conference on Extending Database Technology
Tight bounds for online stable sorting
Journal of Discrete Algorithms
Efficient algorithms for multilevel power estimation of VLSI circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cache index-aware memory allocation
Proceedings of the international symposium on Memory management
Brainy: effective selection of data structures
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
Upper bounds for maximally greedy binary search trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the matter of dynamic optimality in an extended model for tree access operations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Modeling Billion-Node Torus Networks Using Massively Parallel Discrete-Event Simulation
PADS '11 Proceedings of the 2011 IEEE Workshop on Principles of Advanced and Distributed Simulation
Computational Geometry: Theory and Applications
SIAM Journal on Computing
Price roll-backs and path auctions: an approximation scheme for computing the market equilibrium
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Dynamic asymmetric communication
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On following the perturbed leader in the bandit setting
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms
Faster algorithms for sorting by transpositions and sorting by block-interchanges
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Journal of Network and Computer Applications
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
An efficient implementation of sugiyama's algorithm for layered graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
A component-based planning framework for adaptive systems
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Network of shortcuts: an adaptive data structure for tree-based search methods
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An empirical study for inversions-sensitive sorting algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An O(log log n)-competitive binary search tree with optimal worst-case access times
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Poketree: a dynamically competitive data structure with good worst-case performance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Pinpointing data locality problems using data-centric analysis
CGO '11 Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A deterministic o(m log m) time algorithm for the reeb graph
Proceedings of the twenty-eighth annual symposium on Computational geometry
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Computer Science Review
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A priority queue with the time-finger property
Journal of Discrete Algorithms
Dynamizing succinct tree representations
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
CBTree: a practical concurrent self-adjusting search tree
DISC'12 Proceedings of the 26th international conference on Distributed Computing
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Firewall packet filtering optimization using statistical traffic awareness test
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Computational Intelligence and Neuroscience
Diagnosis and optimization of application prefetching performance
Proceedings of the 27th international ACM conference on International conference on supercomputing
Fibonacci BSTs: A new balancing method for binary search trees
Theoretical Computer Science
Event pool structures for PDES on many-core Beowulf clusters
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Warp speed: executing time warp on 1,966,080 cores
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization
Simple and efficient clause subsumption with feature vector indexing
Automated Reasoning and Mathematics
On compressing permutations and adaptive sorting
Theoretical Computer Science
Strategies for Traffic-Aware VM Migration
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.11 |
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an amortized time bound of O(log n) per operation, where by “amortized time” is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access sequences, splay trees are as efficient, to within a constant factor, as static optimum search trees. The efficiency of splay trees comes not from an explicit structural constraint, as with balanced trees, but from applying a simple restructuring heuristic, called splaying, whenever the tree is accessed. Extensions of splaying give simplified forms of two other data structures: lexicographic or multidimensional search trees and link/cut trees.