Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Increasing robustness in global adaptive quadrature through interval selection heuristics
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Computer Systems (TOCS)
On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
Analysis of new variants of coalesced hashing
ACM Transactions on Database Systems (TODS)
Organization of clustered files for consecutive retrieval
ACM Transactions on Database Systems (TODS)
Amortized efficiency of list update and paging rules
Communications of the ACM
A class of sorting algorithms based on Quicksort
Communications of the ACM - Lecture notes in computer science Vol. 174
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Self-adjusting binary search trees
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Height-balanced trees of order (β, γ, δ)
ACM Transactions on Database Systems (TODS)
An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
Disk cache—miss ratio analysis and design considerations
ACM Transactions on Computer Systems (TOCS)
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
An expert system for a resource allocation problem
Communications of the ACM
A probability model for overflow sufficiency in small hash tables
Communications of the ACM
The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations
Communications of the ACM
Modeling the storage architectures of commercial database systems
ACM Transactions on Database Systems (TODS)
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Fragmentation: a technique for efficient query processing
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
Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
Independent general principles for constructing responsive software systems
ACM Transactions on Computer Systems (TOCS)
Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
ACM Transactions on Computer Systems (TOCS)
Tree rebalancing in optimal time and space
Communications of the ACM
Min-max heaps and generalized priority queues
Communications of the ACM
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
A portable Ada implementation of index sequential input-output, part 2
ACM SIGAda Ada Letters
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Rotation distance, triangulations, and hyperbolic geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Data flow analysis for `intractable' system software
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Database performance evaluation in an indexed file environment
ACM Transactions on Database Systems (TODS)
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An editor for revision control
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Database Systems (TODS)
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Optimal dimension of hypercubes for sorting
ACM SIGARCH Computer Architecture News
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mapping data flow programs on a VLSI array of processors
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Implementation of a compiler for a semantic data model: Experiences with taxis
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Design and evaluation of parallel pipelined join algorithms
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
An optimal O(n log n) algorithm for contour reconstruction from rays
SCG '87 Proceedings of the third annual symposium on Computational geometry
Establishing order in planar subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
File organizations & incrementally specified queries
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Predictive test compression by hashing
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Office-by-example: an integrated office system and database manager
ACM Transactions on Information Systems (TOIS)
Linear probing with a nonuniform address distribution
Journal of the ACM (JACM)
External hashing with limited internal storage
Journal of the ACM (JACM)
Communications of the ACM
Communications of the ACM
An insertion algorithm for a minimal internal path length binary search tree
Communications of the ACM
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Are applicative languages inefficient?
ACM SIGPLAN Notices
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
The input/output complexity of sorting and related problems
Communications of the ACM
Sorting Large Files on a Backend Multiprocessor
IEEE Transactions on Computers
A lower bound on the path length of binary trees
ACM SIGACT News
The AIS-5000 Parallel Processor
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special Issue on Industrial Machine Vision and Computer Vision Technology:8MPart
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Hashing practice: analysis of hashing and universal hashing
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Broadcast Normalization in Systolic Design
IEEE Transactions on Computers
A pseudo-machine for packet monitoring and statistics
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
A transition from bubble to shell sort
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Applying Synthesis Principles to Create Responsive Software Systems
IEEE Transactions on Software Engineering
A Benchmark Parallel Sort for Shared Memory Multiprocessors
IEEE Transactions on Computers
The Join Algorithms on a Shared-Memory Multiprocessor Database Machine
IEEE Transactions on Software Engineering
A structured approach to program optimization
IEEE Transactions on Software Engineering
A common schema for dynamic programming and branch and bound algorithms
Journal of the ACM (JACM)
On the path length of binary trees
Journal of the ACM (JACM)
Optimum combinations of sorting and merging
Journal of the ACM (JACM)
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
More analysis of double hashing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Active memory for text information retrieval
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
An O (N log N) algorithm for boolean mask operations
25 years of DAC Papers on Twenty-five years of electronic design automation
Random number generators: good ones are hard to find
Communications of the ACM
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
An O(NlogN) hypercube N-body integrator
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Concurrent operations on priority queues
Communications of the ACM
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
Data compression with finite windows
Communications of the ACM
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Criteria for Selecting a Variable in the Construction of Efficient Decision Trees
IEEE Transactions on Computers
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
Electronics Technology and Computer Science, 1940-1975: A Coevolution
IEEE Annals of the History of Computing
Improving Quicksort Performance with a Codeword Data Structure
IEEE Transactions on Software Engineering
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Computers
Parallel Sorting in a Ring Network of Processors
IEEE Transactions on Computers
Performance of a two-headed disk system when serving database queries under the scan policy
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Software Engineering
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
IEEE Transactions on Software Engineering
Systolic s/sup 2/-Way Merge Sort is Optimal
IEEE Transactions on Computers
Binary partitions with applications to hidden surface removal and solid modelling
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Merging and Sorting Networks with the Topology of the Omega Network
IEEE Transactions on Computers
Combinatorial analysis of ramified patterns and computer imagery of trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Multikey access methods based on term discrimination and signature clustering
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
On generating random permutations with arbitrary distributions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Sparse Gaussian Elimination with Controlled Fill-In on a Shared Memory Multiprocessor
IEEE Transactions on Computers
The Maximum and Minimum Selector SELRAM and its Application for Developing Fast Sorting Machines
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
A computer assisted optimal depth lower bound for sorting networks with nine inputs
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
The periodic balanced sorting network
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
On the Design of a Unidirectional Systolic Array for Key Enumeration
IEEE Transactions on Computers
Optimization Strategies for Relational Queries
IEEE Transactions on Software Engineering
The cost distribution of clustering in random probing
Journal of the ACM (JACM)
Query optimization in a memory-resident domain relational calculus database system
ACM Transactions on Database Systems (TODS)
HYTREM-A Hybrid Text-Retrieval Machine for Large Databases
IEEE Transactions on Computers
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Fast hashing of variable-length text strings
Communications of the ACM
Sorting n Objects with a k-Sorter
IEEE Transactions on Computers
Computational Improvements in Prolog Applications by Predicate Variable Pointers
IEEE Transactions on Software Engineering
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Optimization for dynamic inverted index maintenance
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Performance comparison of extendible hashing and linear hashing techniques
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
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
Optimal disk I/O with parallel block transfer
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Evaluation criteria for functional specifications
ICSE '90 Proceedings of the 12th international conference on Software engineering
IEEE Transactions on Computers
Optimal sample cost residues for differential database batch query problems
Journal of the ACM (JACM)
Parallel Processing of large node B-trees
IEEE Transactions on Computers
Minimal space, average linear time duplicate deletion
Communications of the ACM
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
Multiple Resolution Segmentation of Textured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Implementing partition on vector computers
ICS '91 Proceedings of the 5th international conference on Supercomputing
On randomly interleaved memories
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Large-scale sorting in parallel memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation
IEEE Transactions on Computers
A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem
IEEE Transactions on Computers
Optimal VLSI Sorting with Reduced Number of Processors
IEEE Transactions on Computers
Distributive join: a new algorithm for joining relations
ACM Transactions on Database Systems (TODS)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Performance comparison of extendible hashing and linear hashing techniques
ACM SIGSMALL/PC Notes
An efficient directory system for document retrieval
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
An Efficient Channel Routing Algorithm to Yield an Optimal Solution
IEEE Transactions on Computers
Information Dissemination in Trees with Nonuniform Edge Transmission Times
IEEE Transactions on Computers
A method of vector processing for shared symbolic data
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Heap-Filter Merge Join: A New Algorithm for Joining Medium-Size Inputs
IEEE Transactions on Software Engineering
Average case analysis when merging two ordered lists of different length
ACM SIGCSE Bulletin
On partitions and presortedness of sequences
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The analysis of multidimensional searching in quad-trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Practical minimal perfect hash functions for large databases
Communications of the ACM
A hypercubic sorting network with nearly logarithmic depth
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Comments on an Optimal Set of Indices for a Relational Database
IEEE Transactions on Software Engineering
Bit-Tree: a data structure for fast file processing
Communications of the ACM
Media transports and distributed multimedia flows
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Fast search in main memory databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Sequential sampling procedures for query size estimation
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Algorithms for creating indexes for very large tables without quiescing updates
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
Four State Asynchronous Architectures
IEEE Transactions on Computers
The *M-ary tree and *Ternary hillsort
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Performance comparison of join on hypercube and mesh
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
A new approach to text searching
Communications of the ACM
On efficient unsuccessful search
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding the repeated median regression line
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A lower bound for sorting networks based on the shuffle permutation
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supporting the hypercube programming model on mesh architectures: (a fast sorter for iWarp tori)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improving Disk Cache Hit-Ratios Through Cache Partitioning
IEEE Transactions on Computers
A Partially Supervised Learning Algorithm for Linearly Separable Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance of join on an n-dimensional mesh
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Searching spatial objects with index by dimensional projections
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Processing multi-join query in parallel systems
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Complexity of Search Algorithms
IEEE Transactions on Computers
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Blocking for external graph searching
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The new class of g-chain periodic sorters
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
The Minimal Test Set for Multioutput Threshold Circuits Implemented as Sorting Networks
IEEE Transactions on Computers
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Parallel construction and query of suffix trees for two-dimensional matrices
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Implementing the multiprefix operation on parallel and vector computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Approaching classical algorithms in APL2
APL '93 Proceedings of the international conference on APL
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Maximum k-chains in planar point sets: combinatorial structure and algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time-space optimal convex Hull algorithms
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Routing permutations on graphs via matchings
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
WSC '92 Proceedings of the 24th conference on Winter simulation
Distributing molecular biology information: Gopher, WAIS and the University of Houston Gene-Server
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Quick and incomplete responses: the semantic approach
CIKM '93 Proceedings of the second international conference on Information and knowledge management
On the development of a site selection optimizer for distributed and parallel database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
CSC '93 Proceedings of the 1993 ACM conference on Computer science
The CD-ROM foster a new data structure: the B3-tree
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
A Parallel Hash Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
Parallel Algorithms for the Classes of +or-2^b DESCEND and ASCEND Computations on a SIMD Hypercube
IEEE Transactions on Parallel and Distributed Systems
Compiling nested data-parallel programs for shared-memory multiprocessors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Authentication in the Taos operating system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating systems principles
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
2d-bubblesorting in average time O(√N lg N)*
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Estimating page fetches for index scans with finite LRU buffers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Data structures for dynamic queries: an analytical and experimental evaluation
AVI '94 Proceedings of the workshop on Advanced visual interfaces
Search for the maximum of a random walk
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A functional equation often arising in the analysis of algorithms (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
Inverted File Partitioning Schemes in Multiple Disk Systems
IEEE Transactions on Parallel and Distributed Systems
A Multiway Merge Sorting Network
IEEE Transactions on Parallel and Distributed Systems
A General Surface Approach to the Integration of a Set of Range Views
IEEE Transactions on Pattern Analysis and Machine Intelligence
A nonblocking architecture for broadband multichannel switching
IEEE/ACM Transactions on Networking (TON)
Support for implementing scheduling algorithms using MESSIAHS
Scientific Programming - Special issue on operating system support for massively parallel computer architectures
Fast algorithms for universal quantification in large databases
ACM Transactions on Database Systems (TODS)
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Expected deadlock time in a multiprocessing system
Journal of the ACM (JACM)
Patricia tries again revisited
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Automatic correction to misspelled names: a fourth-generation language approach
Communications of the ACM
Pairing heaps: experiments and analysis
Communications of the ACM
An inverted taxonomy of sorting algorithms
Communications of the ACM - Special section on computer architecture
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Sorting n2 Numbers on n x n Meshes
IEEE Transactions on Parallel and Distributed Systems
Effective clustering of objects stored by linear hashing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Disk-tape joins: synchronizing disk and tape access
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The handwritten trie: indexing electronic ink
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A new page table for 64-bit address spaces
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing by means of inductive program learning
ACM Transactions on Software Engineering and Methodology (TOSEM)
The asymptotic complexity of merging networks
Journal of the ACM (JACM)
Design of Self-Testing Checkers for Borden Codes
IEEE Transactions on Computers
A New Self-Routing Permutation Network
IEEE Transactions on Computers
Estimating alphanumeric selectivity in the presence of wildcards
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Basic techniques for design and analysis of algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A combinatorial treatment of balancing networks
Journal of the ACM (JACM)
The influence of caches on the performance of heaps
Journal of Experimental Algorithmics (JEA)
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Thinking about binary trees in an object-oriented world
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Simple randomized mergesort on parallel disks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
ICS '96 Proceedings of the 10th international conference on Supercomputing
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
P-trees: storage efficient multiway trees
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Optimization of a hierarchical file organization for spelling correction
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
The APL 90 project: new directions in APL interpreters technology
APL '85 Proceedings of the international conference on APL: APL and the future
CEMPS: a configurable evacuation management and planning system—a progress report
WSC '93 Proceedings of the 25th conference on Winter simulation
Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search
IEEE Transactions on Parallel and Distributed Systems
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Competitive parallel disk prefetching and buffer management
Proceedings of the fifth workshop on I/O in parallel and distributed systems
Chain growth algorithms for HP-type lattice proteins
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Disk load balancing for video-on-demand systems
Multimedia Systems
Adding some spice to CS1 curricula
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Efficient instruction cache simulation and execution profiling with a threaded-code interpreter
Proceedings of the 29th conference on Winter simulation
Efficient Hardware Hashing Functions for High Performance Computers
IEEE Transactions on Computers
Efficient Routing and Sorting Schemes for de Bruijn Networks
IEEE Transactions on Parallel and Distributed Systems
Average-case analysis in an elementary course on algorithms
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Efficient indexing for broadcast based wireless systems
Mobile Networks and Applications - Special issue on mobile computing and system services
101 spots, or how do users read menus?
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Randomized binary search trees
Journal of the ACM (JACM)
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Memory management during run generation in external sorting
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Algorithms for capacitated vehicle routing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Blocking in parallel multisearch problems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Layout of the batcher bitonic sorter (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Contention in balancing networks resolved (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A study of branch prediction strategies
25 years of the international symposia on Computer architecture (selected papers)
Joint broadcast scheduling and user's cache management for efficient information delivery
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Dynamic skew handling in parallel mining of association rules
Proceedings of the seventh international conference on Information and knowledge management
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
Layered index structures in document database systems
Proceedings of the seventh international conference on Information and knowledge management
A look at several memory management units, TLB-refill mechanisms, and page table organizations
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
q-gram based database searching using a suffix array (QUASAR)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Broadcast scheduling for information distribution
Wireless Networks
Do we teach the right algorithm design techniques?
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Compact grid layouts of multi-level networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How to Sort N Items Using a Sorting Network of Fixed I/O Size
IEEE Transactions on Parallel and Distributed Systems
Toward Correctly Rounded Transcendentals
IEEE Transactions on Computers
Sorting by Parallel Insertion on a One-Dimensional Subbus Array
IEEE Transactions on Computers
Communication conscious radix sort
ICS '99 Proceedings of the 13th international conference on Supercomputing
Improving memory hierarchy performance for irregular applications
ICS '99 Proceedings of the 13th international conference on Supercomputing
Sorting and counting networks of small depth and arbitrary width
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A simple and efficient parallel disk mergesort
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Parallel Multiplication Using Fast Sorting Networks
IEEE Transactions on Computers
Stable set and multiset operations in optimal time and space
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Real-Time Performance of Sorting Algorithms
Real-Time Systems
Performance evaluation of a wireless hierarchical data dissemination system
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line approximate list indexing with applications
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Upper and lower bounds on constructing alphabetic binary trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic generation of discrete random variates
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal one-way sorting on a one-dimensional sub-bus array
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Depth optimal sorting networks resistant to k passive faults
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh 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
The influence of caches on the performance of sorting
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cache performance analysis of traversals and random accesses
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamical system representation of open address hash functions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Query execution in prism and seaview: a cost analysis
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Utilization of a lexicon for spelling correction in modern Greek
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Symbolic hierarchical artwork generation system
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Escher—a geometrical layout system for recursively defined circuits
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
The average time until bucket overflow
ACM Transactions on Database Systems (TODS)
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Performance evaluation of functional disk system with nonuniform data distribution
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
An effective algorithm for parallelizing sort merge joins in the presence of data skew
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS)
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Analysis of index-sequential files with overflow chaining
ACM Transactions on Database Systems (TODS)
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Query optimization in star computer networks
ACM Transactions on Database Systems (TODS)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Duplicate record elimination in large data files
ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Hierarchical file organization and its application to similar-string matching
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Selection and sorting in totally monotone arrays
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Database Systems (TODS)
On the encipherment of search trees and random access files
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
An efficient model for representing and analyzing B-trees
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
Accelerating List Processing in Discrete Programming
Journal of the ACM (JACM)
Sorting Using Networks of Queues and Stacks
Journal of the ACM (JACM)
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
On the Optimality of Some Set Algorithms
Journal of the ACM (JACM)
Upper Bounds for the Total Path Length of Binary Trees
Journal of the ACM (JACM)
A Modified List Technique Allowing Binary Search
Journal of the ACM (JACM)
An Analysis of Drum Storage Units
Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
A Sorting Algorithm for Polynomial Multiplication
Journal of the ACM (JACM)
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Efficiency of Computation of Cayley Tables of 2-Groups
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Lower Bounds on Merging Networks
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Hashing Schemes for Extendible Arrays
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems
Journal of the ACM (JACM)
Big Buckets Are (Are Not) Better!
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Stable Sorting in Asymptotically Optimal Time and Extra Space
Journal of the ACM (JACM)
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
Generation of Binary Trees from Ballot Sequences
Journal of the ACM (JACM)
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Journal of the ACM (JACM)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
The Ford-Johnson Sorting Algorithm Is Not Optimal
Journal of the ACM (JACM)
Performance Measures for Ordered Lists in Random-Access Files
Journal of the ACM (JACM)
External Hashing Schemes for Collections of Data Structures
Journal of the ACM (JACM)
Information Bounds Are Weak in the Shortest Distance Problem
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Optimal Time Minimal Space Selection Algorithms
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
An Algorithm for the K Best Solutions of the Resource Allocation Problem
Journal of the ACM (JACM)
Mechanical Discovery of Classes of Problem-Solving Strategies
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Implicit Data Structures for the Dictionary Problem
Journal of the ACM (JACM)
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Self-organizing scheme for file storage
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Sensitivity problem in dynamic file organization
CSC '87 Proceedings of the 15th annual conference on Computer Science
Quicksort algorithms with an early exit for sorted subfiles
CSC '87 Proceedings of the 15th annual conference on Computer Science
Improved sorting algorithms for parallel computers
CSC '87 Proceedings of the 15th annual conference on Computer Science
On optimal algorithms for solving bi-valued game trees
CSC '87 Proceedings of the 15th annual conference on Computer Science
Inventing a new sorting algorithm: a case study
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Techniques for collision resolution in hash tables with open addressing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Technological advances in software engineering
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Parallel merge-sort algorithms on the HEP
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Use of composite index in DDBMS
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Polynomial evaluations of bi-valued game trees
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
An Efficient General In-Place Parallel Sorting Scheme
The Journal of Supercomputing
Efficient parallel algorithms for some integer problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Massively parallel hash algorithms and performance
CSC '91 Proceedings of the 19th annual conference on Computer Science
Fringe analysis of binary search trees with miniml internal path length
CSC '91 Proceedings of the 19th annual conference on Computer Science
Adaptive post-processing of OCR text via knowledge acquisition
CSC '91 Proceedings of the 19th annual conference on Computer Science
A parallel algorithm for finding crossing numbers of channel routing (abstract and references only)
CSC '91 Proceedings of the 19th annual conference on Computer Science
Teaching database management systems with Java
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Restructuring ordered binary trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Issues in implementing a real time embedded Data Base Management System in Ada
WADAS '86 Proceedings of the third annual Washington Ada symposium on Ada: Ada use in focus : practical lessons in perspective
Priority Queues and Sorting Methods for Parallel Simulation
IEEE Transactions on Software Engineering
Asynchronous scheduling of redundant disk arrays
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Minimizing Communication in the Bitonic Sort
IEEE Transactions on Parallel and Distributed Systems
Multiprecision floating point addition
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
A lower bound on the average-case complexity of shellsort
Journal of the ACM (JACM)
Periodification scheme: constructing sorting networks with constant period
Journal of the ACM (JACM)
Local Versus Global Strategies for Adaptive Quadrature
ACM Transactions on Mathematical Software (TOMS)
A List Insertion Sort for Keys With Arbitrary Key Distribution
ACM Transactions on Mathematical Software (TOMS)
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
ACM Transactions on Mathematical Software (TOMS)
An Experimental Algorithm for N-Dimensional Adaptive Quadrature
ACM Transactions on Mathematical Software (TOMS)
On Computing the Smith Normal Form of an Integer Matrix
ACM Transactions on Mathematical Software (TOMS)
Generating Sorted Lists of Random Numbers
ACM Transactions on Mathematical Software (TOMS)
Linearly Constrained Discrete I1 Problems
ACM Transactions on Mathematical Software (TOMS)
A Simultaneous Iteration Algorithm for Real Matrices
ACM Transactions on Mathematical Software (TOMS)
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
ACM Transactions on Mathematical Software (TOMS)
Algorithms for sparse Gaussian elimination with partial pivoting
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
Recovery Techniques for Database Systems
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Some Techniques for Solving Recurrences
ACM Computing Surveys (CSUR)
Document Formatting Systems: Survey, Concepts, and Issues
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Techniques for Structuring Database Records
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Compact Encodings of List Structure
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the performance of balanced hashing functions when the keys are not equiprobable
ACM Transactions on Programming Languages and Systems (TOPLAS)
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Integrating diverse knowledge sources in text recognition
ACM Transactions on Information Systems (TOIS)
Document processing in a relational database system
ACM Transactions on Information Systems (TOIS)
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device
IEEE Transactions on Computers
Optimal pagination of B-trees with variable-length items
Communications of the ACM
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Communications of the ACM
Speeding up an overrelaxation method of division in Radix-2n machine
Communications of the ACM
An overview of computational complexity
Communications of the ACM
A simple database language for personal computers
Communications of the ACM
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
Efficient algorithms to globally balance a binary search tree
Communications of the ACM
File organization: implementation of a method guaranteeing retrieval in one access
Communications of the ACM
On-the-fly optimization of data structures
Communications of the ACM
Balancing binary trees by internal path reduction
Communications of the ACM
Reducing the retrieval time of hashing method by using predictors
Communications of the ACM
Reducing dictionary size by using a hashing technique
Communications of the ACM
Searching in a dynamic memory with fast sequential access
Communications of the ACM
File archival techniques using data compression
Communications of the ACM
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Operating system support for database management
Communications of the ACM
Representing super-sparse matrices with perturbed values
Communications of the ACM
Implementations for coalesced hashing
Communications of the ACM
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
A unifying look at data structures
Communications of the ACM
Communications of the ACM
Best sorting algorithm for nearly sorted lists
Communications of the ACM
Computer programs for detecting and correcting spelling errors
Communications of the ACM
Deletion in two-dimensional quad trees
Communications of the ACM
Permutation of data blocks in a bubble memory
Communications of the ACM
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
Communications of the ACM
Communications of the ACM
Communications of the ACM
Insertions and deletions in one-sided height-balanced trees
Communications of the ACM
Detection of combined occurrences
Communications of the ACM
Transient-free working-set statistics
Communications of the ACM
A numbering system for binary trees
Communications of the ACM
Representation of many-sided polygons and polygonal lines for rapid processing
Communications of the ACM
A technique for isolating differences between files
Communications of the ACM
Analysis of design alternatives for virtual memory indexes
Communications of the ACM
A data structure for manipulating priority queues
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
An optimal method for deletion in one-sided height-balanced trees
Communications of the ACM
A selective traversal algorithm for binary search trees
Communications of the ACM
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
Interpolation search—a log logN search
Communications of the ACM
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
A comparison of tree-balancing algorithms
Communications of the ACM
Communications of the ACM
Simulations of dynamic sequential search algorithms
Communications of the ACM
Jump searching: a fast sequential search technique
Communications of the ACM
An analysis of algorithms for the Dutch National Flag Problem
Communications of the ACM
Notes on recursion elimination
Communications of the ACM
Implementing Quicksort programs
Communications of the ACM
Communications of the ACM
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
A linear sieve algorithm for finding prime numbers
Communications of the ACM
Communications of the ACM
Pagination of B*-trees with variable-length records
Communications of the ACM
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
An insertion technique for one-sided height-balanced trees
Communications of the ACM
New upper bounds for selection
Communications of the ACM
A comparison of simulation event list algorithms
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
Communications of the ACM
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Merging with parallel processors
Communications of the ACM
Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages
IEEE Transactions on Computers
Communications of the ACM
A computer science course program for small colleges
Communications of the ACM
The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems
IEEE Transactions on Computers
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Entropy-preserving cuttings and space-efficient planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple entropy-based algorithm for planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of an opportunistic index
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive on-line stream merging algorithms for media-on-demand
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A note on the expected distribution of degrees in random binary trees
ACM SIGCSE Bulletin
CCSC '00 Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference
Batch-construction of B+-trees
Proceedings of the 2001 ACM symposium on Applied computing
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations
Journal of Algebraic Combinatorics: An International Journal
Communications of the ACM
Out-of-core build of a topological data structure from polygon soup
Proceedings of the sixth ACM symposium on Solid modeling and applications
Fast parallel in-memory 64-bit sorting
ICS '01 Proceedings of the 15th international conference on Supercomputing
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Model checking systems of replicated processes with spin
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Experiments with file accessing techniques
ACM SIGCSE Bulletin
Minimal perfect hash functions for reserved word lists
ACM SIGPLAN Notices
ACM Transactions on Database Systems (TODS)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Analysing cache effects in distribution sorting
Journal of Experimental Algorithmics (JEA)
Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Distribution-dependent hashing functions and their characteristics
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
On balancing the load in a clustered web farm
ACM Transactions on Internet Technology (TOIT)
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Computing Surveys (CSUR)
Analyzing and compressing assembly code
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Balancing methods for binary search trees
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Disk performance enhancement through Markov-based cylinder remapping
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Sorting and merging on the DAP
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
An augmented directed graph base for application development
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Lower bounds for merging networks
Information and Computation
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
A simple implementation technique for priority search queues
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
A parallel index for semistructured data
Proceedings of the 2002 ACM symposium on Applied computing
Evaluation of database access paths
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Huffman coding with unequal letter costs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Combinatorial compression and partitioning of large dictionaries: theory and experiments
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
A mechanically certified theorem about optimal concurrency of sorting networks
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ACM Transactions on Mathematical Software (TOMS)
Proceedings of the 7th annual conference on Innovation and technology in computer science education
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive intersection and t-threshold problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
A practical approach to implementing line printer graphics
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Mining database structure; or, how to build a data quality browser
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A scalable hash ripple join algorithm
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
High performance dynamic lock-free hash tables and list-based sets
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Client-Server Caching with Expiration Timestamps
Distributed and Parallel Databases
Proceedings of the 2002 international symposium on Low power electronics and design
Incremental polymorphic type checking in B
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compactly encoding unstructured inputs with differential compression
Journal of the ACM (JACM)
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Multi-table search for B-tree files
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Performance analysis of three related assignment problems
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
The complexity of testing predicate locks
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Experiments with B-tree reorganization
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
On B-trees: routing schemes and concurrency
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
B+ trees and indexed sequential files: a performance comparison
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Applying approximate order dependency to reduce indexing space
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Efficient query monitoring using adaptive multiple key hashing
Proceedings of the eleventh international conference on Information and knowledge management
Symmetry and unimodality in t-stack sortable permutations
Journal of Combinatorial Theory Series A
The distributions of the entries of Young tableaux
Journal of Combinatorial Theory Series A
Journal of Combinatorial Theory Series A
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
A generating functionology approach to a problem of Wilf
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Runs of geometrically distributed random variables: a probabilistic analysis
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
A discipline for robustness or storage reduction in binary search trees
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Unstructured data bases or very efficient text searching
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
External hasing with limited internal storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Planning and Control in Artificial Intelligence: A Unifying Perspective
Applied Intelligence
Methods of Step-by-Step Modeling of Random Events
Automation and Remote Control
AbstFinder, A Prototype Natural Language Text Abstraction Finder for Use in Requirements Elicitation
Automated Software Engineering
Design and Evaluation of Tabu Search Algorithms forMultiprocessor Scheduling
Journal of Heuristics
Graph Applications in Programming
Programming and Computing Software
Middle-Tier Extensible Data Management
World Wide Web
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Eliminating counterevidence with applications to accountable certificate management
Journal of Computer Security
Discrete Mathematics
On the diameter of the rotation graph of binary coupling trees
Discrete Mathematics
Computers and Operations Research
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
A note on constructing binary heaps with periodic networks
Information Processing Letters
Journal of Algorithms - Analysis of algorithms
Limit laws for the height in PATRICIA tries
Journal of Algorithms - Analysis of algorithms
A multivariate view of random bucket digital search trees
Journal of Algorithms - Analysis of algorithms
Journal of Algorithms - Analysis of algorithms
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
Randomized splay trees: theoretical and experimental results
Information Processing Letters
International Journal of Parallel Programming
Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLAN
Wireless Personal Communications: An International Journal
Bubble sort: an archaeological algorithmic analysis
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
IEEE Annals of the History of Computing
IEEE Annals of the History of Computing
A Wavelet Representation of Reflectance Functions
IEEE Transactions on Visualization and Computer Graphics
The Split and Merge Protocol for Interactive Video-on-Demand
IEEE MultiMedia
Buffer management based on return on consumption in a multi-query environment
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently instantiating view-objects from remote relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Estimating page fetches for index scans with finite LRU buffers
The VLDB Journal — The International Journal on Very Large Data Bases
Computing in Science and Engineering
Cascading Content-Addressable Memories
IEEE Micro
Concurrent Error Detection and Correction in Real-Time Systolic Sorting Arrays
IEEE Transactions on Computers
Fault Tolerance in a Class of Sorting Networks
IEEE Transactions on Computers
A Fast VLSI-Efficient Self-Routing Permutation Network
IEEE Transactions on Computers
A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata
IEEE Transactions on Computers
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation
IEEE Transactions on Computers
Selection of Indexes to Memory-Resident Entities for Semantic Data
IEEE Transactions on Knowledge and Data Engineering
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
TBSAM: An Access Method for Efficient Processing of Statistical Queries
IEEE Transactions on Knowledge and Data Engineering
Effectiveness of Parallel Joins
IEEE Transactions on Knowledge and Data Engineering
Computational Complexity of Sorting and Joining Relations with Duplicates
IEEE Transactions on Knowledge and Data Engineering
An Approach to Designing Very Fast Approximate String Matching Algorithms
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew
IEEE Transactions on Knowledge and Data Engineering
Atlas: A Nested Relational Database System for Text Applications
IEEE Transactions on Knowledge and Data Engineering
Utilizing Page-Level Join Index for Optimization in Parallel Join Execution
IEEE Transactions on Knowledge and Data Engineering
Speeding Up External Mergesort
IEEE Transactions on Knowledge and Data Engineering
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Visualization Techniques for Mining Large Databases: A Comparison
IEEE Transactions on Knowledge and Data Engineering
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
Time-Space Trade-Off Analysis of Morphic Trie Images
IEEE Transactions on Knowledge and Data Engineering
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
IEEE Transactions on Knowledge and Data Engineering
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Performance of Synchronous Parallel Algorithms with Regular Structures
IEEE Transactions on Parallel and Distributed Systems
Sorting in Mesh Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
IEEE Transactions on Parallel and Distributed Systems
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting
IEEE Transactions on Parallel and Distributed Systems
On Balancing Sorting on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Balanced Parallel Sort on Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Conservative Parallel Simulation of Continuous Time Markov Chains Using Uniformization
IEEE Transactions on Parallel and Distributed Systems
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Adding Multiple-Fault Tolerance to Generalized Cube Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Theoretical Computer Science
Asymptotic analysis of (3, 2, 1)-shell sort
Random Structures & Algorithms
Phase transition for parking blocks, Brownian excursion and coalescence
Random Structures & Algorithms
Thresholds and optimal binary comparison search trees
Journal of Algorithms
Information Sciences—Applications: An International Journal
The height of a binary search tree: the limiting distribution perspective
Theoretical Computer Science
Some results on tries with adaptive branching
Theoretical Computer Science
Restricted rotation distance between binary trees
Information Processing Letters
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Asymptotic analysis of an optimized quicksort algorithm
Information Processing Letters
A hierarchical three-way interconnect architecture for hexagonal processors
Proceedings of the 2003 international workshop on System-level interconnect prediction
ACM Transactions on Mathematical Software (TOMS)
Nordic Journal of Computing
A new method for updating and rebalancing tree-type main memory dictionaries
Nordic Journal of Computing
Nordic Journal of Computing
Approximate average storage utilization of bucket methods with arbitrary fanout
Nordic Journal of Computing
Sorting and Searching using Ternary CAMs
IEEE Micro
Fast In-Place Verification of Data Dependencies
IEEE Transactions on Knowledge and Data Engineering
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
Binary search with delayed and missing answers
Information Processing Letters
Lower bounds for external memory dictionaries
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Reasoning about Structural Equality in XML: A Description Logic Approach
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Computing Stable Models: Worst-Case Performance Estimates
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
An Out-of-Core Sorting Algorithm for Clusters with Processors at Different Speed
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Computational Solutions for Structural Constraints
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Calculating a New Data Mining Algorithm for Market Basket Analysis
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Amortized Complexity of Bulk Updates in AVL-Trees
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Online Data Structures in External Memory
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,
A Framework for Index Bulk Loading and Dynamization
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
Randomized K-Dimensional Binary Search Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
coping with Delays and Time-Outs in Binary Search Procedures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximate Hotlink Assignment
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Probing Approach for Effective Distributed Resource Reservation
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
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
Attacks on Additive Encryption of Redundant Plaintext and Implications on Internet Security
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Efficient Computation of Recurrence Diameters
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Parallel Algorithm and Architecture for Public-Key Cryptosystem
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Biased Skip Lists for Highly Skewed Access Patterns
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
A Fault-Tolerant Merge Sorting Algorithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Thresholds and Optimal Binary Comparison Search Trees
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Meldable Priority Queues
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Efficient "on the Fly" Signature Schemes Based on Integer Factoring
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Recent Filesystem Optimisations on FreeBSD
Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
Performance Engineering Case Study: Heap Construction
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Efficient Sorting Using Registers and Caches
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Interchanging Two Segments of an Array in a Hierarchical Memory System
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Linear Ramified Higher Type Recursion and Parallel Complexity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Directly-Executable Earley Parsing
CC '01 Proceedings of the 10th International Conference on Compiler Construction
Inferring Flow of Control in Program Synthesis by Example
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Origins of Software Performance Engineering: Highlights and Outstanding Problems
Performance Engineering, State of the Art and Current Trends
Origins of Software Performance Engineering: Highlights and Outstanding Problems
Performance Engineering, State of the Art and Current Trends
New Iterative Geometric Methods for Robust Perceptual Image Hashing
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Indexing Text with Approximate q-Grams
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Words, Permutations, and Representations of Numbers
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Improving Mergesort for Linked Lists
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Duality between Prefetching and Queued Writing with Parallel Disks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Sorting 13 Elements Requires 34 Comparisons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Arithmetic Design for Permutation Groups
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On Optimal Hash Tree Traversal for Interval Time-Stamping
ISC '02 Proceedings of the 5th International Conference on Information Security
A study of Eulerian numbers by means of an operator on permutations
European Journal of Combinatorics
Theoretical Computer Science - Algorithms,automata, complexity and games
An incremental unique representation for regular trees
Nordic Journal of Computing
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Analysis of locking behavior in three real database systems
The VLDB Journal — The International Journal on Very Large Data Bases
The height of a random binary search tree
Journal of the ACM (JACM)
Coding schemes variation and its impact on string hashing
Computer Standards & Interfaces
Information Processing Letters
IEEE Transactions on Mobile Computing
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Calculating stack distances efficiently
Proceedings of the 2002 workshop on Memory system performance
On producing join results early
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Emerging behavior as binary search trees are symmetrically updated
Theoretical Computer Science - Latin American theoretical informatics
Efficient URL caching for world wide web crawling
WWW '03 Proceedings of the 12th international conference on World Wide Web
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Automated synthesis of efficient binary decoders for retargetable software toolkits
Proceedings of the 40th annual Design Automation Conference
Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Algorithms for Large-Scale Temporal Aggregation
IEEE Transactions on Knowledge and Data Engineering
Asynchronous parallel disk sorting
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Gončarov polynomials and parking functions
Journal of Combinatorial Theory Series A
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
Optimal binary search trees with costs depending on the access paths
Theoretical Computer Science
Data reduction through early grouping
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Cuckoo hashing: further analysis
Information Processing Letters
A heap-based algorithm for the study of one-dimensional particle systems
Journal of Computational Physics
How asymmetry helps load balancing
Journal of the ACM (JACM)
Design of an interactive spell checker: optimizing the list of offered words
Decision Support Systems
Complexity considerations for transform-domain adaptive filters
Signal Processing
A Theoretical Framework for Memory-Adaptive Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient applicative data types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A top down approach to sorting
SIGCSE '81 Proceedings of the twelfth SIGCSE technical symposium on Computer science education
Merrily we roll along: Some aspects of?
APL '83 Proceedings of the international conference on APL
Color image quantization for frame buffer display
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Selecting the “right” programming language
SIGCSE '82 Proceedings of the thirteenth SIGCSE technical symposium on Computer science education
Research on synthesis of concurrent computing systems (Extended Abstract)
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
A study of branch prediction strategies
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
MANIP-a parallel computer system for implementing branch and bound algorithms
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
An associative/parallel processor for partial match retrieval using superimposed codes
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
PANDA: A Pascal network data base management system
SIGSMALL '82 Proceedings of the 5th ACM SIGSMALL symposium on Small systems
Notes on merging networks (Prelimiary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An O (N log N) algorithm for Boolean mask operations
DAC '81 Proceedings of the 18th Design Automation Conference
Efficient Boolean operations on IC masks
DAC '81 Proceedings of the 18th Design Automation Conference
A linear probing sort and its analysis(Preliminary Draft)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An index organization for applications with highly skewed access patterns
ICSE '81 Proceedings of the 5th international conference on Software engineering
Adaptation of the TL event list algorithm to the GASP IV simulation language
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Intelligent magnetic bubble memories
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Analysis of an inverted data base structure
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Record block allocation for retrieval on secondary keys
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
On the necessary evolution towards improvement specialization in software production teams
SIGCPR '77 Proceedings of the fifteenth annual SIGCPR conference
Teaching programming to beginners
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of priority queue maintenance
STOC '77 Proceedings of the ninth 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
The analysis of an improved hashing technique
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The IIT MST in computer science program
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
Sorting on a mesh-connected parallel computer
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The analysis of double hashing(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Associative retrieval trie hash-coding (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Location of a point in a planar subdivision and its applications
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
AQL: An APL based system for accessing and manipulating data in a Relational Database System
APL '76 Proceedings of the eighth international conference on APL
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Hashing schemes for extendible arrays (Extended Abstract)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Efficient stable sorting with minimal extra space
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On some generalizations of binary search
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An Introduction To DIAM Levels Of Abstraction In Accessing Information
ACM '78 Proceedings of the 1978 annual conference
ACM '78 Proceedings of the 1978 annual conference
A representation for linear lists with movable fingers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computing integrated costs of sequences of operations with application to dictionaries
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Implicit data structures (Preliminary Draft)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Information retrieval with APL by adaptive index and user guidance
APL '79 Proceedings of the international conference on APL: part 1
On translating a set of rectangles
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Optimal tree layout (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Space-time tradeoffs and first order problems in a model of programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Heuristics for weighted perfect matching
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Efficient dynamic programming using quadrangle inequalities
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A principle of algorithm design on limited problem domain
DAC '76 Proceedings of the 13th Design Automation Conference
Symbolic mathematical computation in a Ph.D. computer science program
SIGCSE '72 Proceedings of the second SIGCSE technical symposium on Education in computer science
Representations for enclosed arrays
APL '81 Proceedings of the international conference on APL
A MUMPS-based Relational Data Base system (MRDB)
ACM '76 Proceedings of the 1976 annual conference
Some experiments in directory organization - a simulation study
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Hashing LEMMAs on time complexities with applications to formula manipulation
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Double cosets and searching small groups
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Checking for spelling and typographical errors in computer-based text
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Distributed allocation with pools of servers
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An outline of a mathematical model for the definition and manipulation of data
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
On the use of bit maps for multiple key retrieval
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Environments for monitoring and dynamic analysis of execution
ANSS '73 Proceedings of the 1st symposium on Simulation of computer systems
3-D graphic display of discrete spatial data by prism maps
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Performance evaluation of packet radio systems by simulation—a case study
WSC '78 Proceedings of the 10th conference on Winter simulation - Volume 2
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Dictionary machines with a small number of processors
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Cache hit ratios with geometric task switch intervals
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Amortized efficiency of list update rules
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A database management system for design engineers
DAC '82 Proceedings of the 19th Design Automation Conference
The excell method for efficient geometric access to data
DAC '82 Proceedings of the 19th Design Automation Conference
Computer science education in small colleges - a report with recommendations
SIGUCCS '72 Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers
A new class of two stage parallel sorting schemes
ACM '82 Proceedings of the ACM '82 conference
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
Organizing and accessing files for magnetic bubble memory and charge coupled devices
ACM '79 Proceedings of the 1979 annual conference
Applications of the theory of random graphs to average algorithm performance analysis
ACM '79 Proceedings of the 1979 annual conference
ACM '78 Proceedings of the 1978 annual conference - Volume 2
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Minimizing the retrieval time of scatter storage techniques
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Interactive system for controlled vocabulary maintenance
ACM '77 Proceedings of the 1977 annual conference
Cost evaluation of storage schemes
ACM '74 Proceedings of the 1974 annual conference - Volume 1
The universality of various types of SIMD machine interconnection networks
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
APL\XAD: An extension of APL for abstract data manipulation
APL '74 Proceedings of the sixth international conference on APL
Lexicon design using perfect hash functions
CHI '81 Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems. (Part - II): Human Interface and the User Interface - Volume 1981
A course in effective programming
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
The generation of order statistics in digital computer simulation: A survey
WSC '78 Proceedings of the 10th conference on Winter simulation - Volume 1
Binary search trees and file organization
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
A design aids data base for digital components
DAC '79 Proceedings of the 16th Design Automation Conference
Finding the median under IOI conditions
Informatics in education
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A CAT algorithm for generating permutations with a fixed number of inversions
Information Processing Letters
A new external sorting algorithm with no additional disk space
Information Processing Letters
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Using finite experiments to study asymptotic performance
Experimental algorithmics
Optimizing stable in-place merging
Theoretical Computer Science
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
On the representation of simply generated trees by leftist trees
European Journal of Combinatorics
An efficient spatio-temporal architecture for animation rendering
EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis
Theoretical Computer Science
ACM Transactions on Database Systems (TODS)
Active Memory Processor: A Hardware Garbage Collector for Real-Time Java Embedded Devices
IEEE Transactions on Mobile Computing
On the tractability of the Brownian bridge algorithm
Journal of Complexity
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Efficient sorting using registers and caches
Journal of Experimental Algorithmics (JEA)
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
Journal of Experimental Algorithmics (JEA)
Building signature-trees on path signatures in document databases
Effective databases for text & document management
On the computation of recursion in relational databases
Effective databases for text & document management
Applying genetic algorithms in database partitioning
Proceedings of the 2003 ACM symposium on Applied computing
Structured programming, programming teaching and the language Pascal
ACM SIGPLAN Notices
On the implementation of parsing tables
ACM SIGPLAN Notices
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
MASS: a multi-axis storage structure for large XML documents
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Test data compression and test time reduction using an embedded microprocessor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low power
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
ACM SIGCSE Bulletin
Information Sciences—Informatics and Computer Science: An International Journal
Bounding restricted rotation distance
Information Processing Letters
Scheduling requests on multi-stage multi-server to increase quality of service
Network control and engineering for Qos, security and mobility II
An efficient accessing technique for Taiwanese phonetic transcriptions
ACM Transactions on Asian Language Information Processing (TALIP)
Optimizing result prefetching in web search engines with segmented indices
ACM Transactions on Internet Technology (TOIT)
Generalizing generalized tries
Journal of Functional Programming
Designing a high-performance database engine for the 'Db4XML' native XML database system
Journal of Systems and Software
Finding hidden independent sets in interval graphs
Theoretical Computer Science
Signature file hierarchies and signature graphs: a new index method for object-oriented databases
Proceedings of the 2004 ACM symposium on Applied computing
A pointless derivation of radix sort
Journal of Functional Programming
Journal of Functional Programming
Comparisons in Hoare's Find Algorithm
Combinatorics, Probability and Computing
Random Structures & Algorithms
Computational Linguistics - Special issue on using large corpora: I
Language independent morphological analysis
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
A practical part-of-speech tagger
ANLC '92 Proceedings of the third conference on Applied natural language processing
Unsupervised learning of part-of-speech guessing rules
Natural Language Engineering
Ladderlike stepping and interval jumping searching algorithms for DNA sequences
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
A Dynamically Tuned Sorting Library
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Tuning the collision test for power
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Box-Ball Systems and Robinson-Schensted-Knuth Correspondence
Journal of Algebraic Combinatorics: An International Journal
Extending Kimmo's two-level model of morphology
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A hardware algorithm for high speed morpheme extraction and its implementation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
SEMHE: a generalised two-level system
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The number of bit comparisons used by Quicksort: an average-case analysis
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive sampling for quickselect
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Opportunities for data base reorganization
ACM SIGMOD Record
Teaching data base systems using date and computing surveys
ACM SIGMOD Record
Restructuring ordered binary trees
Journal of Algorithms - Special issue: SODA 2000
Computing stable models: worst-case performance estimates
Theory and Practice of Logic Programming
Solution of the Tower of Hanoi problem using a binary tree
ACM SIGPLAN Notices
Computer-aided definition, manipulation and depiction of objects composed of spheres
ACM SIGGRAPH Computer Graphics
A multi-processor system for hidden-surface-removal
ACM SIGGRAPH Computer Graphics
Computer-aided definition, manipulation and depiction of objects composed of spheres
ACM SIGGRAPH Computer Graphics
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
A first course in computer science for graduate students
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
Knowledge integration in a robust and efficient morpho-syntactic analyzer for French
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Managing routing tables for URL routers in content distribution networks
International Journal of Network Management
Approximate hotlink assignment
Information Processing Letters
Information Processing Letters
Bijections for refined restricted permutations
Journal of Combinatorial Theory Series A
ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Journal of Algorithms
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
LexEQUAL: multilexical matching operator in SQL
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Edge-disjoint routing in plane switch graphs in linear time
Journal of the ACM (JACM)
A general method for solving divide-and-conquer recurrences
ACM SIGACT News
A note on the worst case of heapsort
ACM SIGACT News
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
IBM Journal of Research and Development
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Characteristics of production database workloads and the TPC benchmarks
IBM Systems Journal - End-to-end security
Expected worst-case partial match in random quadtries
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Phorma: perfectly hashable order restricted multidimensional arrays
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
A method for speeding up text retrieval
ACM SIGMIS Database - Database techniques and models for the office environment: selected papers from the Database Week Conference
Design of a document filing and retrieval system
ACM SIGMIS Database - Database techniques and models for the office environment: selected papers from the Database Week Conference
HIDE: an infrastructure for efficiently protecting information leakage on the address bus
ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Additive Decompositions, Random Allocations, and Threshold Phenomena
Combinatorics, Probability and Computing
A page-coherent, causally consistent protocol for distributed shared memory
Journal of Systems and Software
Proceedings of the 11th ACM conference on Computer and communications security
An optimal search tree: complete binary search tree
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
XPath lookup queries in P2P networks
Proceedings of the 6th annual ACM international workshop on Web information and data management
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Threshold based Selective Survivability for Optical WDM Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Adaptive 4-8 Texture Hierarchies
VIS '04 Proceedings of the conference on Visualization '04
An asymptotic optimality of the transposition rule for linear lists
ACM SIGMETRICS Performance Evaluation Review
A simulation model of a multi-computer system solving a combinatorial problem
WSC '82 Proceedings of the 14th conference on Winter Simulation - Volume 1
Outlier Mining in Large High-Dimensional Data Sets
IEEE Transactions on Knowledge and Data Engineering
Journal of Computer and System Sciences - Special issue: STOC 2003
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
Longest increasing subsequences in sliding windows
Theoretical Computer Science
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Lexical analysis of German texts
ACM SIGLASH Newsletter
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
The management of operating system state data
ACM SIGOPS Operating Systems Review
Building a new sort function for a C library
Software—Practice & Experience
Least-recently-used caching with dependent requests
Theoretical Computer Science
Data structures for maintaining set partitions
Random Structures & Algorithms
Optimizing Sorting with Genetic Algorithms
Proceedings of the international symposium on Code generation and optimization
The Journal of Supercomputing
Fun-sort--or the chaos of unordered binary search
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Increasing the Accuracy and Coverage of SQL Progress Indicators
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Permutation statistics and the q, t-Catalan sequence
European Journal of Combinatorics
The mixing time of the thorp shuffle
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Performance analysis of "Groupby-After-Join" query processing in parallel database systems
Information Sciences—Informatics and Computer Science: An International Journal
Mapping dynamic programming onto modular linear systolic arrays
Distributed Computing
Improved algorithm for maximizing service of carousel storage
Computers and Operations Research
An efficient data structure for branch-and-bound algorithm
Information Sciences—Informatics and Computer Science: An International Journal
Extracting grammar from programs: brute force approach
ACM SIGPLAN Notices
Graphical query interfaces for semistructured data: the QURSED system
ACM Transactions on Internet Technology (TOIT)
Theoretical Computer Science - Descriptional complexity of formal systems
Theoretical Computer Science
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Theoretical Computer Science
Beat the clock: a multiple attribute approach for scheduling data broadcast
Proceedings of the 4th ACM international workshop on Data engineering for wireless and mobile access
On search in peer-to-peer file sharing systems
Proceedings of the 2005 ACM symposium on Applied computing
Statistical analysis of heuristics for evolving sorting networks
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A categorization theorem on suffix arrays with applications to space efficient text indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved range-summable random variable construction algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Algorithms for Document Placement in Distributed Web Servers
IEEE Transactions on Parallel and Distributed Systems
Real-Time Optimal Adaptation for Planetary Geometry and Texture: 4-8 Tile Hierarchies
IEEE Transactions on Visualization and Computer Graphics
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
A generalization of the 0-1 principle for sorting
Information Processing Letters
Transfer theorems and asymptotic distributional results for m-ary search trees
Random Structures & Algorithms
Higher-Order and Symbolic Computation
Encyclopedia of Computer Science
Encyclopedia of Computer Science
HLT '91 Proceedings of the workshop on Speech and Natural Language
Optimization strategies for complex queries
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Note on the minimal permutations
European Journal of Combinatorics
An in-place sorting with O(nlog n) comparisons and O(n) moves
Journal of the ACM (JACM)
An optical model of computation
Theoretical Computer Science
Bulk loading large collections of hyperlinked resources
Proceedings of the sixteenth ACM conference on Hypertext and hypermedia
List processing: sort again, naturally
ACM SIGCSE Bulletin
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The algebra of binary search trees
Theoretical Computer Science - Combinatorics on words
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
The Guessing Secrets problem: a probabilistic approach
Journal of Algorithms
Tuning an algebraic manipulation system through measurements
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
A comparative study of algorithms for sparse polynomial multiplication
ACM SIGSAM Bulletin
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON)
Restructuring binary search trees revisited
Information Processing Letters
Statistics on wreath products, perfect matchings, and signed words
European Journal of Combinatorics - Special issue on combinatorics and representation theory
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
On Dimensions of a Random Solid Diagram
Combinatorics, Probability and Computing
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Optimal XOR hashing for a linearly distributed address lookup in computer networks
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
A case study on alternate representations of data structures in XML
Proceedings of the 2005 ACM symposium on Document engineering
HyLog: A High Performance Approach to Managing Disk Layout
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Providing information from the environment for growing electronic circuits through polymorphic gates
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
A benchmark for the sorting network problem
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Some experiments in directory organization: a simulation study
ACM SIGSIM Simulation Digest
Evolutionary Design of Arbitrarily Large Sorting Networks Using Development
Genetic Programming and Evolvable Machines
Individual displacements for linear probing hashing with different insertion policies
ACM Transactions on Algorithms (TALG)
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
IEEE Transactions on Knowledge and Data Engineering
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the average depth of asymmetric LC-tries
Information Processing Letters
Information Processing Letters
Knowledge map creation and maintenance for virtual communities of practice
Information Processing and Management: an International Journal
Journal of the ACM (JACM)
LZ trie and dictionary compression
Software—Practice & Experience
A study of modified interpolation search in compressed, fully transposed, ordered files
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
FUNCTIONAL PEARL: Enumerating the rationals
Journal of Functional Programming
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
An experimental analysis of self-adjusting computation
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Enhancing Mobile Web Access Using Intelligent Recommendations
IEEE Intelligent Systems
TreeDT: Tree Pattern Mining for Gene Mapping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The scientific works of Rainer Kemp (1949-2004)
Theoretical Computer Science
Research note: Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Information Processing and Management: an International Journal
The binomial transform and the analysis of skip lists
Theoretical Computer Science
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
Future Generation Computer Systems - Systems performance analysis and evaluation
On quickselect, partial sorting and multiple quickselect
Information Processing Letters
Distribution sort with randomized cycling
Journal of the ACM (JACM)
A concentration bound for the longest increasing subsequence of a randomly chosen involution
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Algorithmic aspects of area-efficient hardware/software partitioning
The Journal of Supercomputing
Old and young leaves on plane trees
European Journal of Combinatorics
A combination of trie-trees and inverted files for the indexing of set-valued attributes
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Extremal Weighted Path Lengths In Random Binary Search Trees
Probability in the Engineering and Informational Sciences
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Probabilistic analysis of algorithms for the Dutch national flag problem
Theoretical Computer Science
Hybrid quantum-classical computing with applications to computer graphics
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
AI Communications - CASC
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Storing and retrieving XPath fragments in structured P2P networks
Data & Knowledge Engineering - Special issue: WIDM 2004
Engineering a cache-oblivious sorting algorithm
Journal of Experimental Algorithmics (JEA)
On Generating All Binary Trees
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On the computational rationale for generative models
Computer Vision and Image Understanding
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Dyck paths and pattern-avoiding matchings
European Journal of Combinatorics
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms (TALG)
Average case analysis for tree labelling schemes
Theoretical Computer Science
Revenue analysis of a family of ranking rules for keyword auctions
Proceedings of the 8th ACM conference on Electronic commerce
Software Design and Architecture The once and future focus of software engineering
FOSE '07 2007 Future of Software Engineering
Linux Kernel hash table behavior: analysis and improvements
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Cdt: a general and efficient container data type library
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Reducing the number of transistors in digital circuits using gate-level evolutionary design
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Data models for secondary storage representations
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Stanford's generalized database system
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Partial-match queries and file designs
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
On the lexicographical generation of compressed codes
Information Processing Letters
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
Enabling efficient orienteering behavior in webmail clients
Proceedings of the 20th annual ACM symposium on User interface software and technology
Analysis of a restricted test case set for a sorting network genetic algorithm
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Lower bounds for expected-case planar point location
Computational Geometry: Theory and Applications
AQuery: query language for ordered data, optimization techniques, and experiments
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
ACM SIGPLAN Lisp Pointers
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Detecting distance-based outliers in streams of data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
CellSort: high performance sorting on the cell processor
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Storage optimization for large-scale distributed stream-processing systems
ACM Transactions on Storage (TOS)
Much ado about two (pearl): a pearl on parallel prefix computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Parallel merging with restriction
The Journal of Supercomputing
Distributed subchannel assignment in an OFDMA relay
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics
Improved random graph isomorphism
Journal of Discrete Algorithms
Balls and bins with structure: balanced allocations on hypergraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding an optimal tree searching strategy in linear time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
System-wide energy minimization for real-time tasks: Lower bound and approximation
ACM Transactions on Embedded Computing Systems (TECS)
Parallel sorting on ILLIAC array processor
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
Probability in the Engineering and Informational Sciences
Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
Journal of Computational Physics
Parallel out-of-core sorting and fast accesses to disks
International Journal of High Performance Computing and Networking
High-speed parallel external sorting of data with arbitrary distribution
International Journal of High Performance Computing and Networking
Parallel buffers for chip multiprocessors
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
An experimental study of sorting and branch prediction
Journal of Experimental Algorithmics (JEA)
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
A cache invalidation scheme for continuous partial match queries in mobile computing environments
Distributed and Parallel Databases
Adaptive load sharing for network processors
IEEE/ACM Transactions on Networking (TON)
On searching compressed string collections cache-obliviously
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An alternative analysis of the open hashing algorithm
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
An analysis of average search cost of the external hashing with separate chain
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
Testing for buffer overflows with length abstraction
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
ACM Transactions on Software Engineering and Methodology (TOSEM)
Journal of Computational and Applied Mathematics
A sorting approach to indexing spatial data
ACM SIGGRAPH 2008 classes
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
Efficient context-sensitive word completion for mobile devices
Proceedings of the 10th international conference on Human computer interaction with mobile devices and services
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A functional implementation of the garsia--wachs algorithm: (functional pearl)
Proceedings of the 2008 ACM SIGPLAN workshop on ML
Parallel external sort of floating-point data by integer conversion
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Blending e-learning and knowledge management for optimizing learning paths
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Bilingual Word Association Networks
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Arithmetic Operators for Pairing-Based Cryptography
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Smoothing a Network of Planar Polygonal Lines Obtained with Vectorization
Graphics Recognition. Recent Advances and New Opportunities
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Tight Bounds for Hashing Block Sources
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Efficient data structures for sparse network representation
International Journal of Computer Mathematics - COMPLEX NETWORKS
Guidance of Loop Ordering for Reduced Memory Usage in Signal Processing Applications
Journal of Signal Processing Systems
Sorting hierarchical data in external memory for archiving
Proceedings of the VLDB Endowment
Efficient implementation of sorting on multi-core SIMD CPU architecture
Proceedings of the VLDB Endowment
Dwarfs in the rearview mirror: how big are they really?
Proceedings of the VLDB Endowment
Extremely fast text feature extraction for classification and indexing
Proceedings of the 17th ACM conference on Information and knowledge management
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics
Dynamic data organization for bitmap indices
Proceedings of the 3rd international conference on Scalable information systems
Instruction-based development: From evolution to generic structures of digital circuits
International Journal of Knowledge-based and Intelligent Engineering Systems - Adaptive Hardwarel / Evolvable Hardware
Note: Order statistics and estimating cardinalities of massive data sets
Discrete Applied Mathematics
Algorithmic aspects for power-efficient hardware/software partitioning
Mathematics and Computers in Simulation
A peer-to-peer file search and download protocol for wireless ad-hoc networks
Computer Communications
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity
Runtime Verification
Speeding Up the Pollard Rho Method on Prime Fields
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Scalable parallel multiple recursive generators of large order
Parallel Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
(Un)expected behavior of digital search tree profile
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Sorting and selection in posets
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
String hashing for linear probing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms (TALG)
Uniform organization of inverted files
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Variable-length hash area entries
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
An introduction to computed chaining
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Theoretical Computer Science
Searching for a lion in the desert: optics-based acquisition algorithms for wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Optimal conclusive sets for comparator networks
Theoretical Computer Science
Detecting outlying properties of exceptional objects
ACM Transactions on Database Systems (TODS)
Computers and Electrical Engineering
Individual displacements in hashing with coalesced chains
Combinatorics, Probability and Computing
Basic Characteristics and Learning Potential of a Digital Spiking Neuron
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Secure Multiparty Computation for Comparator Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The Container Problem in Bubble-Sort Graphs
IEICE - Transactions on Information and Systems
Future Generation Computer Systems
Resource sharing in behavioral based scheduling
Proceedings of the 2009 ACM symposium on Applied Computing
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Dictionary-based order-preserving string compression for main memory column stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A spell checker and corrector for the native South African language, South Sotho
Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association
k-ary search on modern processors
Proceedings of the Fifth International Workshop on Data Management on New Hardware
The Art of Programming or Programs as Art
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Phonetic Spelling and Heuristic Search
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
psort, Yet Another Fast Stable Sorting Software
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A new algorithm for multiple key interpolation search in uniform list of numbers
CIS'09 Proceedings of the international conference on Computational and information science 2009
Solving the sorting network problem using iterative optimization with evolved hypermutations
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Addressing morphological variation in alphabetic languages
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Score and rank convergence of HITS
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
On the Value of Multiple Read/Write Streams for Data Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Indexing Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
The Number of Symbol Comparisons in QuickSort and QuickSelect
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Accelerating certain outputs of merging and sorting networks
Theoretical Computer Science
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distance estimates for planning in the discrete belief space
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
On Smoothed Analysis of Quicksort and Hoare's Find
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Fine-Grained Data Distribution Operations for Particle Codes
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Cartesian Embedded Boundary Method for the Compressible Navier-Stokes Equations
Journal of Scientific Computing
When Harry met Harri: cross-lingual name spelling normalization
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A Fast and Flexible Sorting Algorithm with CUDA
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Leveraging Call Center Logs for Customer Behavior Prediction
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Asymptotically optimal encodings of conformant planning in QBF
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
On bijections for pattern-avoiding permutations
Journal of Combinatorial Theory Series A
FICO: web person disambiguation via weighted similarity of entity contexts
SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
Dynamic ADTs: a "don't ask, don't tell" policy for data abstraction
Proceedings of the 2007 International Lisp Conference
Phonetic models for generating spelling variants
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Human evaluation of machine translation through binary system comparisons
StatMT '07 Proceedings of the Second Workshop on Statistical Machine Translation
All-word prediction as the ultimate confusable disambiguation
CHSLP '06 Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing
Trajectory tree as an object-oriented hierarchical representation for video
IEEE Transactions on Circuits and Systems for Video Technology
Computing correctly rounded integer powers in floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Algorithms (TALG)
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Low-cost management of inverted files for online full-text search
Proceedings of the 18th ACM conference on Information and knowledge management
Mining TV broadcasts for recurring video sequences
Proceedings of the ACM International Conference on Image and Video Retrieval
Near-optimal data allocation over multiple broadcast channels
Computer Communications
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast multiple-symbol detection for free-space optical communications
IEEE Transactions on Communications
IEEE Transactions on Communications
Optimal real number codes for fault tolerant matrix operations
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
A survey of evolutionary algorithms for clustering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Interactive Paraphrase Training: The Development and Testing of an iSTART Module
Proceedings of the 2009 conference on Artificial Intelligence in Education: Building Learning Systems that Care: From Knowledge Representation to Affective Modelling
IBM Systems Journal
Storage and access in relational data bases
IBM Systems Journal
A versatile linear insertion sorter based on an FIFO scheme
Microelectronics Journal
String path search procedures for data base systems
IBM Journal of Research and Development
The history of language processor technology in IBM
IBM Journal of Research and Development
Rank modulation for flash memories
IEEE Transactions on Information Theory
Detecting malicious nodes in peer-to-peer streaming by peer-based monitoring
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Comparing integer data structures for 32- and 64-bit keys
Journal of Experimental Algorithmics (JEA)
Measuring influence of an item in a database over time
Pattern Recognition Letters
Proceedings of the VLDB Endowment
Fault tolerance in distributed genetic algorithms with tree topologies
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Gate-level optimization of polymorphic circuits using Cartesian genetic programming
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Extensible User-Based XML Grammar Matching
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
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
Pattern Matching for 321-Avoiding Permutations
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient implementation of the generalized Tunstall code generation algorithm
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Language models for contextual error detection and correction
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
Dynamic Incremental Hashing in Program Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Problem frames and software engineering
Information and Software Technology
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
On designing fast nonuniformly distributed IP address lookup hashing algorithms
IEEE/ACM Transactions on Networking (TON)
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
International Journal of Computers and Applications
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science
Distributional analysis of swaps in Quick Select
Theoretical Computer Science
Suffix trees and string complexity
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
The Journal of Machine Learning Research
External sorting with on-the-fly compression
BNCOD'03 Proceedings of the 20th British national conference on Databases
Time-efficient self-stabilizing algorithms through hierarchical structures
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Inherent fault tolerance in evolved sorting networks
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A new data compression technique for event based program traces
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
An improved fast signature scheme without online multiplication
FC'02 Proceedings of the 6th international conference on Financial cryptography
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Fast and efficient training of RBF networks
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Introduction to software performance engineering: origins and outstanding problems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Online shape learning using binary search trees
Image and Vision Computing
External sorting for index construction of large semantic web databases
Proceedings of the 2010 ACM Symposium on Applied Computing
Linear-time ranking of permutations
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A systems theoretic approach to the design of scalable cryptographic hash functions
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Event-based lossy compression for effective and efficient OLAP over data streams
Data & Knowledge Engineering
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Engineering burstsort: towards fast in-place string sorting
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
Independence results for n-ary recursion theorems
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Cross-entropy optimization for sensor selection problems
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Efficient symbol detection in multi-device STBC-MIMO system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Deterministic hot-potato permutation routing on the mesh and the torus
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Reducing the area on a chip using a bank of evolved filters
ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
Object composition in scenario-based programming
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Multi-attribute inverted files implemented with hashing
ACM-SE 15 Proceedings of the 15th annual Southeast regional conference
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms (TALG)
An efficient parallel implementation of the MSPAI preconditioner
Parallel Computing
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
ENOD sort on diamond architecture
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
Revisiting priority queues for image analysis
Pattern Recognition
Hashing and canonicalizing Notation 3 graphs
Journal of Computer and System Sciences
Computing the throughput of probabilistic and replicated streaming applications
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Difficulties in forcing fairness of polynomial time inductive inference
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
A linear time and space algorithm for detecting path intersection
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Translation caching: skip, don't walk (the page table)
Proceedings of the 37th annual international symposium on Computer architecture
Concurrent heap-based network sort engine—Toward enabling massive and high speed per-flow queuing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems
IEEE Transactions on Wireless Communications
Correcting charge-constrained errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Correcting limited-magnitude errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Computer Methods and Programs in Biomedicine
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptivity and self-organization in organic computing systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Codes in permutations and error correction for rank modulation
IEEE Transactions on Information Theory
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
Journal of Combinatorial Theory Series A
A new parallel sorting on diamond architecture
ECC'10 Proceedings of the 4th conference on European computing conference
Random records and cuttings in binary search trees
Combinatorics, Probability and Computing
ChunkStash: speeding up inline storage deduplication using flash memory
USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
Unsupervised Part-of-Speech Tagging in the Large
Research on Language and Computation
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
The performance of the Haskell containers package
Proceedings of the third ACM Haskell symposium on Haskell
Probability of repeating patterns in simultaneous neural data
Neural Computation
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Algorithm design and analysis techniques
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Sorting network development using cellular automata
ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
On support of ordering in multidimensional data structures
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Adaptive conflict unit size for distributed optimistic synchronization
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A geometric approach for efficient licenses validation in DRM
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
ACM SIGGRAPH ASIA 2010 Courses
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Proceedings of the VLDB Endowment
FlashStore: high throughput persistent key-value store
Proceedings of the VLDB Endowment
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Public-key encryption with registered keyword search
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Distributed subchannel assignment in a two-hop network
Computer Networks: The International Journal of Computer and Telecommunications Networking
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Posets with seven linear extensions sortable by three comparisons
Information Processing Letters
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Sorting algorithms as special cases of a priority queue sort
Proceedings of the 42nd ACM technical symposium on Computer science education
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reductions of Young Tableau Bijections
SIAM Journal on Discrete Mathematics
SPAF: stateless FSA-based packet filters
IEEE/ACM Transactions on Networking (TON)
Cultural Heritage: Out-of-core selection and editing of huge point clouds
Computers and Graphics
ENOD sort on diamond architecture
ELECTRO'10 Proceedings of the 8th WSEAS international conference on Applied electromagnetics, wireless and optical communications
Bitonic sorters of minimal depth
Theoretical Computer Science
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters
Foundations and Trends in Databases
psort, yet another fast stable sorting software
Journal of Experimental Algorithmics (JEA)
Concrete stream calculus: An extended study
Journal of Functional Programming
Educational software for study the performances of some known parallel and sequential algorithms
WSEAS Transactions on Information Science and Applications
HyLog: a high performance approach to managing disk layout
FAST'04 Proceedings of the 3rd USENIX conference on File and storage technologies
Importance of explicit vectorization for CPU and GPU software performance
Journal of Computational Physics
Nemoz: a distributed framework for collaborative media organization
Ubiquitous knowledge discovery
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Interactive environment for comparative analysis of sequential and parallel algorithms
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Nemoz: a distributed framework for collaborative media organization
Ubiquitous knowledge discovery
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Efficient connectivity testing of hypercubic networks with faults
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Teaching the art of computer programming (TAOCP)
Proceedings of the 16th Western Canadian Conference on Computing Education
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the expected longest length probe sequence for hashing with separate chaining
Journal of Discrete Algorithms
Succinct nearest neighbor search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Concept disambiguation exploiting semantic databases
Proceedings of the International Workshop on Semantic Web Information Management
TELE-INFO'11/MINO'11/SIP'11 Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing
Resizable, scalable, concurrent hash tables via relativistic programming
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Decoding permutation arrays with ternary vectors
Designs, Codes and Cryptography
Compressed string dictionaries
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
Recursive merge sort with erroneous comparisons
Discrete Applied Mathematics
Quantum multiplexing with optical coherent states
Quantum Information & Computation
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Really fast syndrome-based hashing
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory Series A
The participation loop: helping citizens to get in
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
European Journal of Combinatorics
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
The analysis of Range Quickselect and related problems
Theoretical Computer Science
Parallel sorting with minimal data
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
High-speed high-security signatures
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Using virtual embryogenesis in multi-robot organisms
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Rule weights in a neuro-fuzzy system with a hierarchical domain partition
International Journal of Applied Mathematics and Computer Science
SDDSfL vs. local disk-a comparative study for Linux
Annales UMCS, Informatica
A mathematical model for managing XML data
International Journal of Metadata, Semantics and Ontologies
Keyed hash function based on a chaotic map
Information Sciences: an International Journal
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
SIAM Journal on Scientific Computing
Sorting and Selection in Posets
SIAM Journal on Computing
Linear Probing with 5-wise Independence
SIAM Review
Compiler techniques to improve dynamic branch prediction for indirect jump and call instructions
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Partial match queries in random quadtrees
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
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Renewal theory in the analysis of tries and strings
Theoretical Computer Science
Intervals of balanced binary trees in the Tamari lattice
Theoretical Computer Science
An efficient index scheme for XML databases
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Which sort orders are interesting?
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Analyzing the impact of change in multi-threaded programs
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Rank selection in multidimensional data
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Longest increasing subsequences in windows based on canonical antichain partition
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On Buffon machines and numbers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary
Journal of Biomedical Informatics
Positional and confidence voting-based consensus functions for fuzzy cluster ensembles
Fuzzy Sets and Systems
A generic import framework for process event logs
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Shape matching using a binary search tree structure of weak classifiers
Pattern Recognition
String matching with alphabet sampling
Journal of Discrete Algorithms
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Fast real-time job selection with resource constraints under earliest deadline first
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
International Journal of Applied Cryptography
Continuous sampling from distributed streams
Journal of the ACM (JACM)
Intrinsic evolution of sorting networks: a novel complete hardware implementation for FPGAs
ICES'05 Proceedings of the 6th international conference on Evolvable Systems: from Biology to Hardware
Minimizing power in hardware/software partitioning
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Information Sciences: an International Journal
Testing polymorphic properties
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Two constant-factor-optimal realizations of adaptive heapsort
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
International Journal of Applied Cryptography
An optimal candidate selection model for self-acting load balancing of parallel file system
International Journal of High Performance Computing and Networking
Bounded model checking of software using SMT solvers instead of SAT solvers
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
The growing-tree sorting algorithm
WSEAS Transactions on Information Science and Applications
Journal of Discrete Algorithms
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the theoretical properties of swap multimoves
Operations Research Letters
The S-digraph optimization problem and the greedy algorithm
Discrete Optimization
Sort-sharing-aware query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Minimizing user effort in XML grammar matching
Information Sciences: an International Journal
Reduced split/merge propagation in a modified B-link tree design
Journal of Computational Methods in Sciences and Engineering
RAIDR: Retention-Aware Intelligent DRAM Refresh
Proceedings of the 39th Annual International Symposium on Computer Architecture
Manufacturing & Service Operations Management
Use of permutation prefixes for efficient and scalable approximate similarity search
Information Processing and Management: an International Journal
Resource optimization in distributed real-time multimedia applications
Multimedia Tools and Applications
Aggregate licenses validation for digital rights violation detection
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
Optimized trace transform based content based image retrieval algorithm
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Is your permutation algorithm unbiased for n ≠ 2m?
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Sorting with bialgebras and distributive laws
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
On Generating All Binary Trees
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Practical algorithms for generating a random ordering of the elements of a weighted set
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Coherent out-of-core point-based global illumination
EGSR'11 Proceedings of the Twenty-second Eurographics conference on Rendering
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Indexing Google 1T for low-turnaround wildcarded frequency queries
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Student Research Workshop
A High-Speed Drug Interaction Search System for Ease of Use in the Clinical Environment
Journal of Medical Systems
Sequential testing policies for complex systems under precedence constraints
Expert Systems with Applications: An International Journal
Sailfish: a framework for large scale data processing
Proceedings of the Third ACM Symposium on Cloud Computing
Periodic load balancing on the N-cycle: analytical and experimental evaluation
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Generic complexity of undecidable problems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
SliceSort: efficient sorting of hierarchical data
Proceedings of the 21st ACM international conference on Information and knowledge management
A positional access method for relational databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Scalable Programmable Motion Effects on GPUs
Computer Graphics Forum
Automation and Remote Control
A lightweight stream-based join with limited resource consumption
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
Size matters: exhaustive geometric verification for image retrieval accepted for ECCV 2012
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
A new approach to commutative watermarking-encryption
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Smaller self-indexes for natural language
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
CBTree: a practical concurrent self-adjusting search tree
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Information Sciences: an International Journal
HYBRIDJOIN for Near-Real-Time Data Warehousing
International Journal of Data Warehousing and Mining
Parallel sparse polynomial multiplication on modern hardware architectures
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
A derivation-first approach to teaching algorithms
Proceeding of the 44th ACM technical symposium on Computer science education
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Efficient high-similarity string comparison: the waterfall algorithm
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Timeline index: a unified data structure for processing queries on temporal data in SAP HANA
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fibonacci BSTs: A new balancing method for binary search trees
Theoretical Computer Science
Normalised LCS-based method for indexing multidimensional data cube
International Journal of Intelligent Information and Database Systems
Single machine scheduling with delivery dates and cumulative payoffs
Journal of Scheduling
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Cache-centric video recommendation: an approach to improve the efficiency of YouTube caches
Proceedings of the 4th ACM Multimedia Systems Conference
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
Journal of Discrete Algorithms
High-throughput soft-output MIMO detector based on path-preserving trellis-search algorithm
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Lazy incremental computation for efficient scene graph rendering
Proceedings of the 5th High-Performance Graphics Conference
Optimal selection and sorting via dynamic programming
Journal of Experimental Algorithmics (JEA)
Texture feature evaluation for segmentation of historical document images
Proceedings of the 2nd International Workshop on Historical Document Imaging and Processing
Counting and occurrence sort for GPUs using an embedded language
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Using symmetry and evolutionary search to minimize sorting networks
The Journal of Machine Learning Research
Computation time efficient approach for licenses validation in DRM systems
Multimedia Tools and Applications
Evaluating simulation software components with player rating systems
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Spatial indexing in agent-based crowd simulation
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Version of the new SHA standard applied to manage certificate revocation in VANETs
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
A non-time series approach to vehicle related time series problems
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Adjoint folds and unfolds-An extended study
Science of Computer Programming
Distance-Sensitive planar point location
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A sound and complete abstraction for reasoning about parallel prefix sums
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Using DSP blocks to compute CRC hash in FPGA (abstract only)
Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays
Simple analysis of partial worst-case execution paths on general control flow graphs
Proceedings of the Eleventh ACM International Conference on Embedded Software
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
On compressing permutations and adaptive sorting
Theoretical Computer Science
Accelerating incremental checkpointing for extreme-scale computing
Future Generation Computer Systems
An intuitive and simple bounding argument for Quicksort
Information Processing Letters
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
Efficient heuristic and tabu search for hardware/software partitioning
The Journal of Supercomputing
The Journal of Supercomputing
Scheduling modular projects on a bottleneck resource
Journal of Scheduling
The edge-centered surface area of the arrangement graph
Journal of Combinatorial Optimization
Fast automatic security protocol generation
Journal of Computer Security
INSPM: An interactive evolutionary multi-objective algorithm with preference model
Information Sciences: an International Journal
| Hi-index | 2.00 |