Space-Time Trade-Offs for Banded Matrix Problems
Journal of the ACM (JACM)
Resolving the query inference problem using Steiner trees
ACM Transactions on Database Systems (TODS)
Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Eliminating Redundant Recursive Calls.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information-flow and data-flow analysis of while-programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR)
Feedback vertex sets and cyclically reducible graphs
Journal of the ACM (JACM)
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)
Cautious transaction schedulers with admission control
ACM Transactions on Database Systems (TODS)
An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
Lower bounds for solving linear diophantine equations on random access machines
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Complete logical routings in computer mail systems
ACM Transactions on Information Systems (TOIS)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Predicting fill for sparse orthogonal factorization
Journal of the ACM (JACM)
A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
A fault identification algorithm for ti-diagnosable systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Routing multiterminal nets around a rectangle
IEEE Transactions on Computers - The MIT Press scientific computation series
Planar point location using persistent search trees
Communications of the ACM
IEEE Transactions on Computers - The MIT Press scientific computation series
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The impact of interprocedural analysis and optimization in the Rn programming environment
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Min-max heaps and generalized priority queues
Communications of the ACM
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An automatic overlay generator
IBM Journal of Research and Development
The complexity of optimization problems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Compile-time partitioning and scheduling of parallel programs
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
The equivalence of solving queries and producing tree projections (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection
IEEE Transactions on Computers
Optimal Rotation Problems in Channel Routing
IEEE Transactions on Computers
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Query processing in main memory database management systems
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A public key cryptosystem based on the word problem
Proceedings of CRYPTO 84 on Advances in cryptology
Data flow graph partitioning to reduce communication cost
MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
Using algorithms as keys in stream ciphers
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multicommodity flows in planar undirected graphs and shortest paths
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Retargetable microcode synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient recompilation of module interfaces in a software development environment
SDE 2 Proceedings of the second ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Software configuration—an NP-complete problem
SIGCPR '87 Proceedings of the conference on The 1987 ACM SIGBDP-SIGCPR Conference
The cookie cutter algorithm for handling mixed hierarchy
ACM SIGDA Newsletter
Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
A new approach to all pairs shortest paths in planar graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Testing for cycles in infinite graphs with periodic structure
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A Smalltalk system for algebraic manipulation
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs
Journal of the ACM (JACM)
An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
New applications of failure functions
Journal of the ACM (JACM)
Efficient interpretation of synchronizable series expressions
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Constructive real interpretation of numerical programs
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Automatic translation of FORTRAN programs to vector form
ACM Transactions on Programming Languages and Systems (TOPLAS)
A data-driven model for a subset of logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Convexity algorithms in parallel coordinates
Journal of the ACM (JACM)
Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
IEEE Transactions on Computers
An object-oriented approach to algebra system design
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Divide-and-conquer in computational group theory
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Limitations to algorithm solvability: Galois methods and models of computation
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The computer algebra system CAS1 for the IBM-PC
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
IEEE Transactions on Computers
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
How to share a secret with cheaters
Proceedings on Advances in cryptology---CRYPTO '86
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Implementing System/36 advanced peer-to-peer networking
IBM Systems Journal
Improving virtual-grid compaction through grouping
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Finding the optimal variable ordering for binary decision diagrams
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Automatic decomposition of scientific programs for parallel execution
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Establishing order in planar subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Best “ordering” for floating-point addition
ACM Transactions on Mathematical Software (TOMS)
ACE: an automatic complexity evaluator
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power of the frame buffer
ACM Transactions on Graphics (TOG)
The physical mapping problem for parallel architectures
Journal of the ACM (JACM)
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
A nonlinear lower bound for random-access machines under logarithmic cost
Journal of the ACM (JACM)
Are applicative languages inefficient?
ACM SIGPLAN Notices
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
Multipipeline Networking for Compound Vector Processing
IEEE Transactions on Computers
A Synthesis Algorithm for Reconfigurable Interconnection Networks
IEEE Transactions on Computers
Generations of permutations with non-unique elements
ACM SIGNUM Newsletter
A linear time algorithm for optimal routing around a rectangle
Journal of the ACM (JACM)
Learning Dominance Relations in Combined Search Problems
IEEE Transactions on Software Engineering
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
Using induction to design algorithms
Communications of the ACM
Design of a dependency-directed compiler for constraint propagation
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Pitfalls in the design of distributed routing algorithms
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Combining Static Concurrency Analysis with Symbolic Execution
IEEE Transactions on Software Engineering
Synthesizing Linear Array Algorithms from Nested FOR Loop Algorithms
IEEE Transactions on Computers
Concurrent Access of Priority Queues
IEEE Transactions on Computers
Constructing Submodule Specifications and Network Protocols
IEEE Transactions on Software Engineering
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multiplicative complexity of polynomial multiplication over finite fields
Journal of the ACM (JACM)
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Communication-sensitive heuristics and algorithms for mapping compilers
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
An O (N log N) algorithm for boolean mask operations
25 years of DAC Papers on Twenty-five years of electronic design automation
25 years of DAC Papers on Twenty-five years of electronic design automation
Parallel expert system search techniques for a real-time application
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Block-matrix operations using orthogonal trees
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems
IEEE Transactions on Computers
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Multiple-Way Network Partitioning
IEEE Transactions on Computers
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Journal of Symbolic Computation
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Residual hermite normal form computations
ACM Transactions on Mathematical Software (TOMS)
On distributed processibility of datalog queries by decomposing databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Feature Extraction from Boundary Models of Three-Dimensional Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved bounds for rectangular and guillotine partitions
Journal of Symbolic Computation
A Fast Algorithm for Testing Isomorphism of Permutation Networks
IEEE Transactions on Computers
A Note on Nondeterminism in Small, Fast Parallel Computers
IEEE Transactions on Computers
Static analysis of low-level synchronization
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
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
A New Algorithm for Multiplication in Finite Fields
IEEE Transactions on Computers
Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
An efficient parallel algorithm for computing a large independent set in a plan graph
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Constructing trees in parallel
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal size integer division circuits
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel depth-first search in general directed graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Clustering algorithms based on minimum and maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Detecting equality of variables in programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Optimal parallel algorithm for visibility of a simple polygon from a point
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum partitioning simple rectilinear polygons in O(n log log n) - time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Stabbing pairwise disjoint translates in linear time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A framework for scheduling multi-rate circuit simulation
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
ELF: a tool for automatic synthesis of custom physical CAD software
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Efficient floorplan area optimization
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Min-cost partitioning on a tree structure and applications
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
The implications of program dependencies for software testing, debugging, and maintenance
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Storing text retrieval systems on CD-ROM: compression and encryption considerations
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Design of Parity Testable Combinational Circuits
IEEE Transactions on Computers
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
AT/sup 2/-Optimal Galois Field Multiplier for VLSI
IEEE Transactions on Computers
Using semantic knowledge of transactions to increase concurrency
ACM Transactions on Database Systems (TODS)
Query processing techniques in the summary-table-by-example database query language
ACM Transactions on Database Systems (TODS)
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
A New Spectral Test for Nonrandomness and the DES
IEEE Transactions on Software Engineering
A Note on the Linear Transformation Method for Systolic Array Design
IEEE Transactions on Computers
A Decomposition Approach for Balancing Large-Scale Acyclic Data Flow Graphs
IEEE Transactions on Computers
Analysis of euclidean algorithms for polynomials over finite fields
Journal of Symbolic Computation
Compression, information theory, and grammars: a unified approach
ACM Transactions on Information Systems (TOIS)
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Nondeterministic polynomial-time computations and models of arithmetic
Journal of the ACM (JACM)
Parallel asynchronous algorithms for discrete data
Journal of the ACM (JACM)
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
A Framework for the Automated Drawing of Data Structure Diagrams
IEEE Transactions on Software Engineering
Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks
IEEE Transactions on Computers
A Partial Scan Method for Sequential Circuits with Feedback
IEEE Transactions on Computers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Complexity of computation on real algebraic numbers
Journal of Symbolic Computation
A decision theoretic approach to information retrieval
ACM Transactions on Database Systems (TODS)
Effective resource utilization for multiprocessor join execution
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Commutativity and its role in the processing of linear recursion
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
On Computing Signal Probability and Detection Probability of Stuck-At Faults
IEEE Transactions on Computers
Identifying the semantic and textual differences between two versions of a program
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Deciding ML typability is complete for deterministic exponential time
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the Euclidean scheme for polynomials having interlaced real zeros
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Exploiting fast matrix multiplication within the level 3 BLAS
ACM Transactions on Mathematical Software (TOMS)
Unboundedly parallel simulations via recurrence relations
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Cutting hyperplane arrangements
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Look ma, no hashing, and no arrays neither
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient computation on oblivious RAMs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The role of term symmetry in E-completion procedures
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
The complexity of equivalence for commutative rings
Journal of Symbolic Computation
Performability Analysis Using Semi-Markov Reward Processes
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Automatic transformation of series expressions into loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Optimization of array accesses by collective loop transformations
ICS '91 Proceedings of the 5th international conference on Supercomputing
A graph theoretic technique to speed up floorplan area optimization
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Composite Programs: Hierarchical Construction, Circularity, and Deadlocks
IEEE Transactions on Software Engineering
Some results on stochastic language modeling
HLT '91 Proceedings of the workshop on Speech and Natural Language
Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
More time-work tradeoffs for parallel graph algorithms
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Size and access inference for data-parallel programs
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Parallel multiplication and powering of polynomials
Journal of Symbolic Computation
Generalization of Min-Cut Partitioning to Tree Structures and its Applications
IEEE Transactions on Computers
Improved Diagnosability Algorithms
IEEE Transactions on Computers
SDE: Incremental Specification and Development of Communications Software
IEEE Transactions on Computers - Special issue on protocol engineering
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Partial evaluation of pattern matching in constraint logic programming languages
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
An optimal parallel algorithm for the visibility of a simple polygon from a point
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
CRYPTO '89 Proceedings on Advances in cryptology
Computer analysis of user interfaces based on repetition in transcripts of user sessions
ACM Transactions on Information Systems (TOIS)
ACM SIGPLAN Lisp Pointers
Searching in discrete universes
ACM SIGPLAN Notices
Constructing Optimal Procedures for Testing Series Systems
IEEE Transactions on Computers
An optimal algorithm for floorplan area optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Corolla based circuit partitioning and resynthesis
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A channel/switchbox definition algorithm for building-block layout
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Automatic test generation using quadratic 0-1 programming
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
High level support for divide-and-conquer parallelism
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Enhanced controllability for IDDQ test sets using partial scan
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
On minimal closure constraint generation for symbolic cell assembly
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Minimizing the number of delay buffers in the synchronization of pipelined systems
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Efficient 2-dimensional approximate matching of non-rectangular figures
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Parallel complexity of tridiagonal symmetric Eigenvalue problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Experience with a software-defined machine architecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
Structure forest and composition factors for small base groups in nearly linear time
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Control-Flow Normalization Algorithm and its Complexity
IEEE Transactions on Software Engineering
Knowledge Representation and Reasoning in a Software Synthesis Architecture
IEEE Transactions on Software Engineering - Special issue on knowledge representation and reasoning in software development
A systolic array architecture for multiplying Toeplitz matrices
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A note on checking matrix products (extended abstract)
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
An application of the method of Buckets to the selection problem
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
The concurrency control problem in multidatabases: characteristics and solutions
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
An analysis of Atkinson's algorithm
ACM SIGSAM Bulletin
Optimization of Computation Time for Systolic Arrays
IEEE Transactions on Computers
A parallel algorithm for the minimum spanning tree on an SIMD machine
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Notes on implementing sets in Prolog
Communications of the ACM
A program integration algorithm that accommodates semantics-preserving transformations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Type matching, type-graphs, and the Schanuel conjecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
Spatial machines: a more realistic approach to parallel computation
Communications of the ACM
Design of Optimal Systolic Algorithms for the Transitive Closure Problem
IEEE Transactions on Computers
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On tree-based techniques for query evaluation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Searching tree structures on a mesh of processors
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On parallel complexity of integer linear programming, GCD and the iterated mod function
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algorithms for subset testing and finding maximal sets
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Polynomial root-finding: analysis and computational investigation of a parallel algorithm
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks
IEEE Transactions on Computers
The use of Knuth-Bendix methods to solve the wordproblem in automatic groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Fault-tolerant circuit-switching networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A rational rotation method for robust geometric algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Formal specification of asynchronous distributed real-time systems by APTL
ICSE '92 Proceedings of the 14th international conference on Software engineering
Alphonse: incremental computation as a programming abstraction
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Low level scheduling using the hierarchical task graph
ICS '92 Proceedings of the 6th international conference on Supercomputing
A labeling algorithm for just-in-time scheduling in TDMA networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Automatic clustering of languages
Computational Linguistics - Special issue on inheritance: II
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)
Journal of the ACM (JACM)
Spinor analysis and symbolic computation of partition functions
ACM SIGSAM Bulletin
Loop distribution with multiple exits
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
On the complexity of functions for random access machines
Journal of the ACM (JACM)
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Tutorial notes on partial evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Undecidability of static analysis
ACM Letters on Programming Languages and Systems (LOPLAS)
Journal of Symbolic Computation - Special issue on automatic programming
On computing the transitive closure of a state transition relation
DAC '93 Proceedings of the 30th international Design Automation Conference
Graphs as a language to describe learning system concepts
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the single function coarsest partition problem
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A massively parallel optimizer for expression evaluation
ICS '93 Proceedings of the 7th international conference on Supercomputing
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
An algebraic theory of graph reduction
Journal of the ACM (JACM)
A name model for nested group communication
IEEE/ACM Transactions on Networking (TON)
Tools for view generation in object-oriented databases
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Compiling nested data-parallel programs for shared-memory multiprocessors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithm 727: Quantile estimation using overlapping batch statistics
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fishspear: a priority queue algorithm
Journal of the ACM (JACM)
Efficient computation of Fourier inversion for finite groups
Journal of the ACM (JACM)
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
An efficient representation for sparse sets
ACM Letters on Programming Languages and Systems (LOPLAS)
A linear-time scheme for version reconstruction
ACM Transactions on Programming Languages and Systems (TOPLAS)
VLIW compilation techniques in a superscalar environment
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Integrating pointer variables into one-way constraint models
ACM Transactions on Computer-Human Interaction (TOCHI)
Dynamic parallel tree contraction (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A simpler analysis of algorithm 65 (find)
ACM SIGACT News
Parallel multiplication: a case study in parallel programming
ACM SIGPLAN Notices
ACM SIGPLAN Notices
A generalized carrier-null method for conservative parallel simulation
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Constructing permutation representations for large matrix groups
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Finding blocks of imprimitivity in small-base groups in nearly linear time
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Iterative [simulation-based genetics + deterministic techniques]= complete ATPG0
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay
IEEE Transactions on Computers
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Iterative modulo scheduling: an algorithm for software pipelining loops
MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Linear pattern matching of repeated substrings
ACM SIGACT News
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The computational complexity of recognizing permutation functions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
An efficient zero-skew routing algorithm
DAC '94 Proceedings of the 31st annual Design Automation Conference
Distributed simulation for structural VHDL netlists
EURO-DAC '94 Proceedings of the conference on European design automation
Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast floating-point processing in Common Lisp
ACM Transactions on Mathematical Software (TOMS)
Declarative updates of relational databases
ACM Transactions on Database Systems (TODS)
Efficiently computing Φ-nodes on-the-fly
ACM Transactions on Programming Languages and Systems (TOPLAS)
The role of dynamic programming & control structures in performance
APL '95 Proceedings of the international conference on Applied programming languages
Storage assignment to decrease code size
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
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
The complexity of probabilistic verification
Journal of the ACM (JACM)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
A note on probabilistically verifying integer and polynomial products
Journal of the ACM (JACM)
Comparing the combinational complexities of arithmetic functions
Journal of the ACM (JACM)
Serializability with constraints
ACM Transactions on Database Systems (TODS)
Pairing heaps: experiments and analysis
Communications of the ACM
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Finding connected components on a scan line array processor
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Caching intermediate results for program improvement
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Equivalence checking of datapaths based on canonical arithmetic expressions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ATM: paving the information superhighway
IBM Systems Journal
ACM SIGACT News
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Fast recognition of the nilpotency of permutation groups
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Incremental cryptography and application to virus protection
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Stage scheduling: a technique to reduce the register requirements of a modulo schedule
Proceedings of the 28th annual international symposium on Microarchitecture
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On efficient agnostic learning of linear combinations of basis functions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Programming parallel algorithms
Communications of the ACM
Yet another efficient algorithm for replacing the edges of a minimum spanning tree
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Storage assignment to decrease code size
ACM Transactions on Programming Languages and Systems (TOPLAS)
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Analyzing multi-phase searching algorithms
ACM SIGCSE Bulletin
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)
A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks
IEEE Transactions on Parallel and Distributed Systems
Thinking about binary trees in an object-oriented world
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Factoring modular polynomials (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Parallel distinct degree factorization algorithm
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of Hermite normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
An analysis of gang scheduling for multiprogrammed parallel computing environments
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
ICS '96 Proceedings of the 10th international conference on Supercomputing
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A tight layout of the butterfly network
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Comment on “self-indexed sort”
ACM SIGPLAN Notices
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Visualizing interactions in program executions
ICSE '97 Proceedings of the 19th international conference on Software engineering
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
POSC—a partitioning and optimizing SISAL compiler
ICS '90 Proceedings of the 4th international conference on Supercomputing
Employing finite automata for resource scheduling
MICRO 26 Proceedings of the 26th annual international symposium on Microarchitecture
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal control dependence computation and the Roman chariots problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of simulation models: a graph theoretic approach
WSC '93 Proceedings of the 25th conference on Winter simulation
Approximate complex polynomial evaluation in near constant work per point
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast and precise computations of discrete Fourier transforms using cyclotomic integers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Oblivious data structures: applications to cryptography
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
Fast algorithms for Taylor shifts and certain difference equations
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Componential set-based analysis
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Practical applications of an efficient time separation of events algorithm
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
New faster Kernighan-Lin-type graph-partitioning algorithms
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Efficient computation of unique input/output sequences in finite-state machines
IEEE/ACM Transactions on Networking (TON)
Computing exact geometric predicates using modular arithmetic with single precision
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fast and accurate flow-insensitive points-to analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
A Parallel Scheme Using the Divide-and-Conquer Method
Distributed and Parallel Databases
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The Static Parallelization of Loops and Recursions
The Journal of Supercomputing - Special issue: high performance computing systems
The Journal of Supercomputing - Special issue: high performance computing systems
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Computer science: a proposed alternative track—applied computing
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Journal of the ACM (JACM)
A pattern matching algorithm for verification and analysis of very large IC layouts
ISPD '98 Proceedings of the 1998 international symposium on Physical design
A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
“Maximal-munch” tokenization in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new algorithm for scalar register promotion based on SSA form
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
On reconstructing species trees from gene trees in term of duplications and losses
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
The modulo N extended GCD problem for polynomials
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
On Restricted-Focus-of-Attention Learnability of Boolean Functions
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Fast incremental circuit analysis using extracted hierarchy
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A data structure for circuit net lists
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Ownership types for flexible alias protection
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Deriving Logic Systems for Path Delay Test Generation
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Static caching for incremental computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Do we teach the right algorithm design techniques?
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
The Tractability of Segmentation and Scene Analysis
International Journal of Computer Vision
A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks
IEEE Transactions on Parallel and Distributed Systems
Window-accumulated subsequence matching problem is linear
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Matchmaker: manifold BReps for non-manifold r-sets
Proceedings of the fifth ACM symposium on Solid modeling and applications
Precise timing verification of logic circuits under combined delay model
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Mind your vocabulary: query mapping across heterogeneous information sources
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications
IEEE Transactions on Computers
Knowledge Mining With VxInsight: Discovery ThroughInteraction
Journal of Intelligent Information Systems - Special issue on information visualization: the next frontier
Entropy-based subspace clustering for mining numerical data
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Register allocation in structured programs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Tree compatibility and inferring evolutionary history
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An O(log*n) approximation algorithm for the asymmetric p-center problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New techniques for approximating complex polynomial zeros
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth 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 deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computing the covers of a string in linear time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Extended Banker's Algorithm for Deadlock Avoidance
IEEE Transactions on Software Engineering
Componential set-based analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
A subjective review of compaction (tutorial session)
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Symbolic manipulation of Boolean functions using a graphical representation
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
A new algorithm for floorplan design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Hierarchial global wiring for custom chip design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A simulation of dynamic task allocation in a distributed computer system
WSC '87 Proceedings of the 19th conference on Winter simulation
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
ACM Transactions on Database Systems (TODS)
A database encryption system with subkeys
ACM Transactions on Database Systems (TODS)
Analysis of a heuristic for full trie minimization
ACM Transactions on Database Systems (TODS)
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
A clustered search algorithm incorporating arbitrary term dependencies
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A data structure for arc insertion and regular path finding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Representing sets with constant time equality testing
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the maximum two-chain problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Asymptotically fast triangulation of matrices over rings
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
On the estimation of the number of desired records with respect to a given query
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
A Sorting Algorithm for Polynomial Multiplication
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees
Journal of the ACM (JACM)
Code Generation for a One-Register Machine
Journal of the ACM (JACM)
On the complexity of edge traversing
Journal of the ACM (JACM)
A Combinatorial Problem Which Is Complete in Polynomial Space
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Code Generation for Expressions with Common Subexpressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
On Live-Dead Analysis for Global Data Flow Problems
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Renamings and Economy of Memory in Program Schemata
Journal of the ACM (JACM)
Lower Bounds and Reductions Between Grammar Problems
Journal of the ACM (JACM)
A Linear-Time On-Line Recognition Algorithm for ``Palstar''
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
Assignment Commands with Array References
Journal of the ACM (JACM)
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
Journal of the ACM (JACM)
Optimality of the Fast Fourier transform
Journal of the ACM (JACM)
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM (JACM)
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
Journal of the ACM (JACM)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
Efficient Computation of Expressions with Common Subexpressions
Journal of the ACM (JACM)
New Algorithms for Bin Packing
Journal of the ACM (JACM)
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
Journal of the ACM (JACM)
A New Algorithm for Preemptive Scheduling of Trees
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Information Bounds Are Weak in the Shortest Distance Problem
Journal of the ACM (JACM)
Flowshop scheduling with limited temporary storage
Journal of the ACM (JACM)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Optimal Time Minimal Space Selection Algorithms
Journal of the ACM (JACM)
Probabilistic Aspects of Boolean Switching Functions via a New Transform
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An Algorithm for the K Best Solutions of the Resource Allocation Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM (JACM)
Some Exact Complexity Results for Straight-Line Computations over Semirings
Journal of the ACM (JACM)
On Parallel Computation for the Knapsack Problem
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers
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)
On the Simplification and Equivalence Problems for Straight-Line Programs
Journal of the ACM (JACM)
Design of Minimum-Cost Deadlock-Free Systems
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Improved parallel algorithms for the depth-first search and monotone circuit value problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
Output-size sensitive algorithms for finding maximal vectors
SCG '85 Proceedings of the first annual symposium on Computational geometry
Decomposing polygonal regions into convex quadrilaterals
SCG '85 Proceedings of the first annual symposium on Computational geometry
Rectilinear shortest paths with rectangular barriers
SCG '85 Proceedings of the first annual symposium on Computational geometry
Bounds for partitioning rectilinear polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
Intelligent backtracking using symmetry
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
On optimizing summary-table-by-example queries
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Array processor with multiple broadcasting
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
From recursion to iteration: what are the optimizations?
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Proceedings of the 14th international conference on Supercomputing
Compression using efficient multicasting
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
An approximation algorithm for finding a long path in Hamiltonian graphs
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
Nearly optimal computations with structured matrices
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Implicit enumeration of strongly connected components
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
On-the-Fly Model Checking Under Fairness that Exploits Symmetry
Formal Methods in System Design
Design Wizards and Visual Programming Environments for GenVoca Generators
IEEE Transactions on Software Engineering
An Exterior Newton Method for Strictly Convex Quadratic Programming
Computational Optimization and Applications
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Characteristics of scalability and their impact on performance
Proceedings of the 2nd international workshop on Software and performance
SMC: a symmetry-based model checker for verification of safety and liveness properties
ACM Transactions on Software Engineering and Methodology (TOSEM)
Cryptanalysis of the Matsumoto and Imai Public Key Schemeof Eurocrypt‘98
Designs, Codes and Cryptography
Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization
Journal of VLSI Signal Processing Systems
A Framework for the Design and Implementation of FFT Permutation Algorithms
IEEE Transactions on Parallel and Distributed Systems
Operative diagnosis algorithms for single-fault in graph-based systems
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Data Dependence Analysis of Assembly Code
International Journal of Parallel Programming - Special issue on instruction-level parallelism and parallelizing compilation, part 2
A Simple Parallel Algorithm to Draw Cubic Graphs
IEEE Transactions on Parallel and Distributed Systems
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
ACM Transactions on Mathematical Software (TOMS)
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
ACM Transactions on Mathematical Software (TOMS)
Algorithm 561: Fortran Implementation of Heap Programs for Efficient Table Maintenance [Z]
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Algorithms for Generating Fundamental Cycles in a Graph
ACM Transactions on Mathematical Software (TOMS)
Space-Efficient Implementations of Graph Search Methods
ACM Transactions on Mathematical Software (TOMS)
Algorithms for sparse Gaussian elimination with partial pivoting
ACM Transactions on Mathematical Software (TOMS)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
The Organization of Microprogram Stores
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Encryption and Secure Computer Networks
ACM Computing Surveys (CSUR)
Tabulation Techniques for Recursive Programs
ACM Computing Surveys (CSUR)
Some Techniques for Solving Recurrences
ACM Computing Surveys (CSUR)
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Program Transformation Systems
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
ACM Transactions on Programming Languages and Systems (TOPLAS)
Chaining Span-Dependent Jump Instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Methods for Computing LALR(k) Lookahead
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with the SETL Optimizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursion As an Effective Step in Program Development
ACM Transactions on Programming Languages and Systems (TOPLAS)
A VLSI layout for a pipelined Dadda multiplier
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Information Systems (TOIS)
Task Allocation on a Network of Processors
IEEE Transactions on Computers
Chain mulitplication of matrices of approximately or exactly the same size
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
Visibility aspects of programmed dynamic data structures
Communications of the ACM
On-the-fly optimization of data structures
Communications of the ACM
A sublinear additive sieve for finding prime number
Communications of the ACM
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Computer-assisted microanalysis of programs
Communications of the ACM
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
A linear algorithm for copying binary trees using bounded workspace
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
A unifying look at data structures
Communications of the ACM
A more general algorithm for computing closed semiring costs between vertices of a directed graph
Communications of the ACM
An overrelaxation for a numerical inverse of a constant
Communications of the ACM
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
Communications of the ACM
Communications of the ACM
Communications of the ACM
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Operations on sparse relations
Communications of the ACM
Preserving average proximity in arrays
Communications of the ACM
The editing of picture segmentations using local analysis of graphs
Communications of the ACM
Optimal conversion of extended-entry decision tables with general cost criteria
Communications of the ACM
Assembling code for machines with span-dependent instructions
Communications of the ACM
A data structure for manipulating priority queues
Communications of the ACM
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
An O(n) algorithm for determining a near-optimal computation order of matrix chain products
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
Communications of the ACM
An efficient data structure for the simulation event set
Communications of the ACM
An analysis of inline substitution for a structured programming language
Communications of the ACM
Some new upper bounds on the generation of prime numbers
Communications of the ACM
Optimal surface reconstruction from planar contours
Communications of the ACM
Improving programs by the introduction of recursion
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
Protection in operating systems
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
IEEE Transactions on Computers
Alternatives to splay trees with O(log n) worst-case access times
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
On Estimating the Large Entries of a Convolution
IEEE Transactions on Computers
The Multi-Level Communication: Efficient Routing for Interconnection Networks
The Journal of Supercomputing
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Main-memory index structures with fixed-size partial keys
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
A duplication based compile time scheduling method for task parallelism
Compiler optimizations for scalable parallel systems
ACM SIGPLAN Notices
Individualized course in theoretical computer science
ACM SIGCSE Bulletin
ACM SIGACT News
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On a parallel Lehmer-Euclid GCD algorithm
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Analysing cache effects in distribution sorting
Journal of Experimental Algorithmics (JEA)
Short vectors of planar lattices via continued fractions
Information Processing Letters
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Discovering critical edge sequences in E-commerce catalogs
Proceedings of the 3rd ACM conference on Electronic Commerce
Forced simulation: A technique for automating component reuse in embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Incremental data flow analysis in a structured program editor
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Efficient computation of flow insensitive interprocedural summary information
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Program optimization using indexed and recursive data structures
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A heuristic for optimizing the multiplication of matrix chains
ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
ACM-SE 14 Proceedings of the 14th annual Southeast regional conference
A greedy hypercube-labeling algorithm
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Automata theory: its past and future
A half-century of automata theory
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Real-time properties of indirect recursive procedures
Information and Computation
Computing transformation semigroups
Journal of Symbolic Computation
Approximate solutions of polynomial equations
Journal of Symbolic Computation
On the relationship between model-based debugging and program slicing
Artificial Intelligence
Hiding Relaxed Memory Consistency with a Compiler
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
Closed Partition Lattice and Machine Decomposition
IEEE Transactions on Computers - Special issue on fault-tolerant embedded systems
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)
IEEE Transactions on Computers
Predicting zero coefficients in formal power series computations
Journal of Symbolic Computation
The large scale parallelization of a conformational 3D Protein structure prediction application
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
World-championship-caliber Scrabble
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Hierarchical VLSI design systems based on attribute grammars
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '86 Proceedings of the 13th 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
Almost control-free (indeterministic) parallel computation on permit schemes
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient computation of expressions with common subexpressions
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized common subexpressions in very high level languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An interprocedural data flow analysis algorithm
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The competence/performance dichotomy in programming preliminary report
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Application of lattice algebra to loop optimization
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
0/1 optimization and 0/1 primal separation are equivalent
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Length-restricted coding using modified probability distributions
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Efficiency of data structures for detecting overlaps in digital documents
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
International Journal of Parallel Programming
Revisiting decomposition analysis of geometric constraint graphs
Proceedings of the seventh ACM symposium on Solid modeling and applications
Generating compact code from dataflow specifications of multirate signal processing algorithms
Readings in hardware/software co-design
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependence graphs and compiler optimizations
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Characterization and elimination of redundancy in recursive programs
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
On merging partitioned databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 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
SIGMOD '81 Proceedings of the 1981 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
Query optimization for CODASYL database systems
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Cooperative caching by mobile clients in push-based information systems
Proceedings of the eleventh international conference on Information and knowledge management
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
A simplified correctness proof for a well-known algorithm computing strongly connected components
Information Processing Letters
Signature files and signature trees
Information Processing Letters
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Exploiting structure in quantified formulas
Journal of Algorithms
Using computational learning strategies as a tool for combinatorial optimization
Annals of Mathematics and Artificial Intelligence
STCSP – structured temporal constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Debugging Hardware Designs Using a Value-Based Model
Applied Intelligence
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Automated Software Engineering
Reasoning about Qualitative Spatial Relationships
Journal of Automated Reasoning
Optimal Collision Free Path Planning for Non-Synchronized Motions
Journal of Intelligent and Robotic Systems
The Architecture of the Dalí Main-Memory Storage Manager
Multimedia Tools and Applications
An Efficient Generation Method for Uniformly Distributed Random Numbers
Problems of Information Transmission
A general strategy for decomposing topological invariants of spatial databases and an application
Data & Knowledge Engineering
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On point-duration networks for temporal reasoning
Artificial Intelligence
A Robust Compile Time Method for SchedulingTask Parallelism on Distributed Memory Machines
The Journal of Supercomputing
A speed-up for the commute between subword trees and DAWGs
Information Processing Letters
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Multidimensional Systems and Signal Processing
Bubble sort: an archaeological algorithmic analysis
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
In Order to Form a More Perfect UNION
Computing in Science and Engineering
IEEE Computer Graphics and Applications
A Mathematical Model for Integrated Diagnostics
IEEE Design & Test
Extracting and Restructuring the Design of Large Systems
IEEE Software
Computational Complexity Issues in Operative Diagnostics of Graph-Based Systems
IEEE Transactions on Computers
Almost Sure Diagnosis of Almost Every Good Element
IEEE Transactions on Computers
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
More on Squaring and Multiplying Large Integers
IEEE Transactions on Computers
On Computing Connected Components of Line Segments
IEEE Transactions on Computers
Parallel Minimal Norm Method for Tridiagonal Linear Systems
IEEE Transactions on Computers
Integer Division in Residue Number Systems
IEEE Transactions on Computers
Zero-Aliasing for Modeled Faults
IEEE Transactions on Computers
An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems
IEEE Transactions on Computers
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
A Model for Adaptable Systems for Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
An Approach to Designing Very Fast Approximate String Matching Algorithms
IEEE Transactions on Knowledge and Data Engineering
Response Time Analysis of EQL Real-Time Rule-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Topological Invariants for Lines
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Geometric Reasoning for Extraction of Manufacturing Features in Iso-Oriented Polyhedrons
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays
IEEE Transactions on Parallel and Distributed Systems
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Compile-Time Techniques for Improving Scalar Access Performance in Parallel Memories
IEEE Transactions on Parallel and Distributed Systems
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
Uniform Approach for Solving some Classical Problems on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
A Processor-Time-Minimal Systolic Array for Transitive Closure
IEEE Transactions on Parallel and Distributed Systems
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
The Scalability of FFT on Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Comments on 'Defining Software by Continuous Smooth Functions' by R.A. De Millo and R.J. Lipton
IEEE Transactions on Software Engineering
LISPACK-A Methodology and Tool for the Performance Analysis of Parallel Systems and Algorithms
IEEE Transactions on Software Engineering
Simulation Data Structures for Parallel Resource Management
IEEE Transactions on Software Engineering
Analysis of Real-Time Rule-Based Systems with Behavioral Constraint Assertions Specified in Estella
IEEE Transactions on Software Engineering
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On asymptotically optimal methods of prediction and adaptive coding for Markov sources
Journal of Complexity
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
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Complexity of graph covering problems
Nordic Journal of Computing
Efficient extraction of mapping rules of atoms from enzymatic reaction data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Minimizing subsequential transducers: a survey
Theoretical Computer Science
Multiprocessor Join Scheduling
IEEE Transactions on Knowledge and Data Engineering
Ancestor Controlled Submodule Inclusion in Design Databases
IEEE Transactions on Knowledge and Data Engineering
Extending SQL with Generalized Transitive Closure
IEEE Transactions on Knowledge and Data Engineering
Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach
IEEE Transactions on Knowledge and Data Engineering
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Programming via Static Incrementalization
Higher-Order and Symbolic Computation
Dynamic Programming via Static Incrementalization
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A Parallel DFA Minimization Algorithm
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Fast 2-Variable Integer Programming
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Deleting Keys of B-trees in Parallel
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Optimizing Graph Algorithms for Improved Cache Performance
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
What Do We Learn from Experimental Algorithmics?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Study of Bayesian Clustering of a Document Set Based on GA
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
Using Evolutionary Programming to Optimize the Allocation of Surveillance Assets
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
Logical and Physical Versioning in Main Memory Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Reconstruction and Optimization of Trie Hashing Functions
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Molecular Objects, Abstract Data Types, and Data Models: A Framework
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fixed-point semantics and the representation of algorithms on large data
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Approximate Query Translation Across Heterogeneous Information Sources
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Aggregation and Relevance in Deductive Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
The Power of Methods With Parallel Semantics
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Performance Tuning an Algorithm for Compressing Relational Tables
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Fast Boolean Matrix Multiplication for Highly Clustered Data
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper)
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Knowledge Management: System Architectures, Main Functions, and Implementing Techniques
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Access Control: Policies, Models, and Mechanisms
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Optimizing Routing Algorithms in Telecommunication Networks with Neural Networks and Fuzzy Logic
Proceedings of the 6th International Conference on Computational Intelligence, Theory and Applications: Fuzzy Days
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimal Extension Fields for XTR
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking over Locally Tree-Decomposable Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Generating Necklaces and Strings with Forbidden Substrings
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Evolving Turing Machines for Biosequence Recognition and Analysis
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Spectral Tests for Measuring Nonrandomness and the DES
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Prolog Tailoring Technique on an Epilog Tailored Procedure
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Fast Server-Aided RSA Signatures Secure Against Active Attacks
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Eager Class Initialization for Java
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Sliding Mode Model Semantics and Simulation for Hybrid Systems
Hybrid Systems V
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Dynamic Algorithms with Worst-Case Performance for Packet Classification
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Fast Algorithms for Determining the Linear Complexity of Period Sequences
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Distributed Oblivious Transfer
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Solving Regular Tree Grammar Based Constraints
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Analysing Cache Effects in Distribution Sorting
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Automata and Computational Probabilities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Factorization of Ambiguous Finite-State Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Performing Algorithmic Refinement before Data Refinement in B
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Algorithm for Finding Three Dimensional Symmetry in Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
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
On the Recognition of P4-Comparability Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Fast Algorithms for for Linear Algebra Modulo N
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Graph Automorphisms with Maximal Projection Distances
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
PVM Computation of the Transitive Closure: The Dependency Graph Approach
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Model to Integrate Message Passing and Shared Memory Programming
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Observations on Parallel Computation of Transitive and Max-Closure Problems
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Arithmetic Design for Permutation Groups
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A New Low Complexity Parallel Multiplier for a Class of Finite Fields
CHES '01 Proceedings of the Third 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
Fast Reduction of Ternary Quadratic Forms
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Attribute Value Extraction and Standardization in Data Integration
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Geometric Approach to Boolean Matrix Multiplication
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Detecting emerging concepts in textual data mining
Computational information retrieval
Maintenance of implication integrity constraints under updates to constraints
The VLDB Journal — The International Journal on Very Large Data Bases
The height of a random binary search tree
Journal of the ACM (JACM)
Length-bounded disjoint paths in planar graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Approximate query mapping: Accounting for translation closeness
The VLDB Journal — The International Journal on Very Large Data Bases
Scheduling length for switching element disjoint multicasting in Banyan-type switching networks
Journal of Systems Architecture: the EUROMICRO Journal
An introduction to processor-time-optimal systolic arrays
Highly parallel computaions
The genome generator: simulating the development of junk DNA
Journal of Computing Sciences in Colleges
On parallel block algorithms for exact triangularizations
Parallel Computing
Polynomial factorization over F2
Mathematics of Computation
Coupling-aware high-level interconnect synthesis for low power
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
Information and Computation - Special issue: LICS'97
Handbook of data mining and knowledge discovery
Handbook of automated reasoning
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Acceleration of Euclidean algorithm and extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On the divide-and-conquer approach towards test suite reduction
Information Sciences: an International Journal
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
On uncertainty versus size in branching programs
Theoretical Computer Science
On limits on the computational power of data-accumulating algorithms
Information Processing Letters
Interactive authoring of multimedia documents in a constraint-based authoring system
Multimedia Systems - Special section on video libraries
Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees
Theoretical Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A hierarchical basis for reordering transformations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Placement algorithms for custom VLSI
DAC '83 Proceedings of the 20th Design Automation Conference
Reducing channel density in standard cell layout
DAC '83 Proceedings of the 20th Design Automation Conference
Design For Test Calculus: An algorithm for DFT rules checking
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '83 Proceedings of the 20th Design Automation Conference
Heuristics for the Circuit Realization Problem
DAC '83 Proceedings of the 20th Design Automation Conference
Space efficient algorithms for VLSI artwork analysis
DAC '83 Proceedings of the 20th Design Automation Conference
A symbolic-interconnect router for custom IC design
DAC '84 Proceedings of the 21st Design Automation Conference
DAC '84 Proceedings of the 21st Design Automation Conference
Incorporation of multiaccess links into a routing protocol
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Curve-fitting with piecewise parametric cubics
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
A contour display generation algorithm for VLSI implementation
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Research on synthesis of concurrent computing systems (Extended Abstract)
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
MP/C: A multiprocessor/computer architecture
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A new approximate graph coloring algorithm
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Graph problems on a mesh-connected processor array (Preliminary Version)
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
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the parallel computation for the knapsack problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reversal complexity of counter machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A characterization of the class of functions computable in polynomial time on Random Access Machines
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
On the time overhead of counters and traversal markers
ICSE '81 Proceedings of the 5th international conference on Software engineering
A system for program refinement
ICSE '79 Proceedings of the 4th international conference on Software engineering
Computer-aided micro-analysis of programs
ICSE '79 Proceedings of the 4th international conference on Software engineering
Hierarchical coroutines a mechanism for improved program structure
ICSE '79 Proceedings of the 4th international conference on Software engineering
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Record block allocation for retrieval on secondary keys
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Finding a minimum circuit in a graph
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast probabilistic algorithms for hamiltonian circuits and matchings
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
Nonserial dynamic programming is optimal
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient reducibility between programming systems (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
“Recommended mathematical topics for computer science majors”
SIGCSE '77 Proceedings of the eighth SIGCSE technical symposium on Computer science education
Learning mathematics with recursive computer programs
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
Some complexity results for the Traveling Salesman Problem
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On isomorphisms and density of NP and other complete sets
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Real-time algorithms for string-matching and palindrome recognition
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Optimal code generation for expression trees
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Linear algorithms to recognize interval graphs and test for the consecutive ones property
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Some Open Problems In Cryptography
ACM '78 Proceedings of the 1978 annual conference
How to show something is not: Proofs in formal language and computability theory
SIGCSE '78 Proceedings of the ninth SIGCSE technical symposium on Computer science education
A representation for linear lists with movable fingers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The macro model for data compression (Extended Abstract)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An efficient algorithm for determining whether a cubic graph is toroidal
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Straight-line program length as a parameter for complexity measures
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Optimal evaluation of pairs of bilinear forms
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The recognition of Series Parallel digraphs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Network flow and generalized path compression
STOC '79 Proceedings of the eleventh 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
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Minimum covers in the relational database model (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Developments in verification of design correctness (A Tutorial)
DAC '80 Proceedings of the 17th Design Automation Conference
An integrated mask artwork analysis system
DAC '80 Proceedings of the 17th Design Automation Conference
Complexity theory and design automation
DAC '80 Proceedings of the 17th Design Automation Conference
Dynamically maintaining configurations in the plane (Detailed Abstract)
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
The complexity of the equivalence problem for straight-line programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Complexity of implementations on the level of algebraic specifications
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A time-space tradeoff for sorting on a general sequential model of computation
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On some deterministic space complexity problems
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
A shortest-path algorithm with expected time O(n2 log n log* n)
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
Functional simulation in the lamp system
DAC '76 Proceedings of the 13th Design Automation Conference
Representations for enclosed arrays
APL '81 Proceedings of the international conference on APL
A regular expression pattern matching processor for APL
APL '81 Proceedings of the international conference on APL
The fast Fourier transform its role as an algebraic algorithm
ACM '76 Proceedings of the 1976 annual conference
ACM '76 Proceedings of the 1976 annual conference
Algorithms for Gaussian integer arithmetic
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Practical fast polynomial multiplication
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Arithmetic complexity of unordered sparse polynomials
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Algebraic algorithms using p-adic constructions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Polynomial real root isolation using Descarte's rule of signs
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
The computational complexity of continued fractions
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Note on probabilistic algorithms in integer and polynomial arithmetic
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
On the line breaking problem in text formatting
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Proceedings of the SIGOA conference on Office information systems
A sorting routine of intermediate size and speed
SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
Distributed k-selection: From a sequential to a distributed algorithm
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Optimal associative searching on a cellular computer
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Specification of data structures for FP programs
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Contour filling in raster graphics
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Predetermining visibility priority in 3-D scenes (Preliminary Report)
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Filling regions in binary raster images: A graph-theoretic approach
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Fault-secure algorithms for multiple-processor systems
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
On shortest paths in polyhedral spaces
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On k-hulls and related problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Randomized speed-ups in parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Building a complete inverted file for a set of text files in linear time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Comparison of arithmetic functions with respect to boolean circuit depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A polynomial linear search algorithm for the n-dimensional knapsack problem
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Sparse sets in NP-P: Exptime versus nexptime
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Some theoretical aspects of algorithmic routing
DAC '77 Proceedings of the 14th Design Automation Conference
A new look at test generation and verification
DAC '77 Proceedings of the 14th Design Automation Conference
A minimum-impact routing algorithm
DAC '82 Proceedings of the 19th Design Automation Conference
Topological optimization of an integrated circuit/packet-switched computer network
WSC '84 Proceedings of the 16th conference on Winter simulation
Parallel algorithms for unification and other complete problems in p
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Algorithms for finding diagnosability level and t-diagnosis in a network of processors
ACM '82 Proceedings of the ACM '82 conference
Auditing for secure statistical databases
ACM '81 Proceedings of the ACM '81 conference
Applications of the theory of random graphs to average algorithm performance analysis
ACM '79 Proceedings of the 1979 annual conference
Classes of pebble games and complete problems
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Hierarchical multiprocessor organizations
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A course in effective programming
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
Code generation for expressions with common subexpressions (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
One-way trap door functions based on the Boolean satisfiability problem
ICCC '02 Proceedings of the 15th international conference on Computer communication
Algorithms for Switch Level Delay Fault Simulation
ITC '97 Proceedings of the 1997 IEEE International Test Conference
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
Completeness results for graph isomorphism
Journal of Computer and System Sciences
Rivalling multiprocessor organization: a hardware/speed trade-off
ACM SIGARCH Computer Architecture News
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
The abstraction and instantiation of string-matching programs
The essence of computation
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Teaching algorithms and data structures: 10 personal observations
Computer Science in Perspective
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Length-Restricted Coding in Static and Dynamic Frameworks
DCC '01 Proceedings of the Data Compression Conference
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Computer algebra handbook
Skolem functions of arithmetical sentences
Information and Computation
Replica allocation methods in ad hoc networks with data update
Mobile Networks and Applications
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Adapting Radix Sort to the Memory Hierarchy
Journal of Experimental Algorithmics (JEA)
A Method for Fast Computation of the Fourier Transform over a Finite Field
Problems of Information Transmission
Defining dynamic variables and abstract data types in Pascal
ACM SIGPLAN Notices
Optimal state-space lumping in Markov chains
Information Processing Letters
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Visualizing computer memory architectures
VIS '90 Proceedings of the 1st conference on Visualization '90
Hierarchical triangulation using terrain features
VIS '90 Proceedings of the 1st conference on Visualization '90
Optimal via-shifting in channel compaction
EURO-DAC '90 Proceedings of the conference on European design automation
Fast functional evaluation of candidate OBDD variable orderings
EURO-DAC '91 Proceedings of the conference on European design automation
Restructuring VLSI layout representations for efficiency
EURO-DAC '91 Proceedings of the conference on European design automation
Parallel switch-level simulation for VLSI
EURO-DAC '91 Proceedings of the conference on European design automation
Using Spanning Sets for Coverage Testing
IEEE Transactions on Software Engineering
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Techniques for efficiently allocating persistent storage
Journal of Systems and Software
Disunification in ACI1 Theories
Constraints
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
An efficient algorithm for Horn description
Information Processing Letters
Watermelon uniform random generation with applications
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
The bottleneck independent domination on the classes of bipartite graphs and block graphs
Information Sciences—Informatics and Computer Science: An International Journal
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science
A knowledge-based system for the conceptual design of grippers for handling fabrics
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Mathematical Structures in Computer Science
Dependent types ensure partial correctness of theorem provers
Journal of Functional Programming
Two-pattern strings I: a recognition algorithm
Journal of Discrete Algorithms
Using randomization to make recursive matrix algorithms practical
Journal of Functional Programming
Parallelization of divide-and-conquer by translation to nested loops
Journal of Functional Programming
Extraction of Schematic Array Models for Memory Circuits
Proceedings of the conference on Design, automation and test in Europe - Volume 1
A Novel Implementation of Tile-Based Address Mapping
Proceedings of the conference on Design, automation and test in Europe - Volume 1
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
Local complexity of Boolean functions
Discrete Applied Mathematics
A modular reduction for GCD computation
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Review of "The logic of typed feature structures" by Bob Carpenter. Cambridge University Press 1992.
Computational Linguistics
Finite-state transducers in language and speech processing
Computational Linguistics
An efficient incremental DFA minimization algorithm
Natural Language Engineering
Efficient feature structure operations without compilation
Natural Language Engineering
Replica allocation for correlated data items in ad hoc sensor networks
ACM SIGMOD Record
Investigating the possibility of a microprocessor-based machine translation system
ANLC '83 Proceedings of the first conference on Applied natural language processing
Left-to-right parsing and bilexical context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
An improvement key deletion method for double-array structure using single-nodes
Information Processing and Management: an International Journal
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
On the Computational Complexity of Consumer Decision Rules
Computational Economics
Augmented Dependency Grammar: a simple interface between the grammar rule and the knowledge
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Indexing and referential dependencies within binding theory: a computational framework
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Dynamic compilation of weighted context-free grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the mathematical properties of linguistic theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Compact representations by finite-state transducers
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Bottom-up parsing extending context-freeness in a Process Grammar processor
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for finding long paths in Hamiltonian graphs
Journal of Algorithms - Special issue: SODA 2000
A simple way to construct NFA with fewer states and transitions
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Two parallel implementations for one dimension FFT on symmetric multiprocessors
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Theory and Practice of Logic Programming
Efficiently serving dynamic data at highly accessed web sites
IEEE/ACM Transactions on Networking (TON)
Prediction models for cyclomatic complexity
ACM SIGPLAN Notices
A framework for teaching recursion
ACM SIGCSE Bulletin
Periodic properties of strings
ACM SIGACT News
A clique problem equivalent to graph isomorphism
ACM SIGACT News
The introductory programming course in computer science: ten principles
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
A classification method for Japanese signs using manual motion descriptions
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Text disambiguation by finite state automata, an algorithm and experiments on corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Text disambiguation by finite state automata, an algorithm and experiments on corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Proceedings of the 41st annual Design Automation Conference
On designing via-configurable cell blocks for regular fabrics
Proceedings of the 41st annual Design Automation Conference
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Time-varying reeb graphs for continuous space-time data
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Classical and quantum function reconstruction via character evaluation
Journal of Complexity - Special issue on coding and cryptography
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Graph Matching: A Fast Algorithm and Its Evaluation
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
Independence results in computer science
ACM SIGACT News
Killing two birds with one stone
ACM SIGACT News
A note on the multiplication of 4x4 matrices
ACM SIGACT News
A general method for solving divide-and-conquer recurrences
ACM SIGACT News
Constructing a finite automaton for a given regular expression
ACM SIGACT News
On teaching theoretical foundations of Computer Science
ACM SIGACT News
Experience, generations, and limits in machine learning
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Theoretical Computer Science
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Improved algorithm for all pairs shortest paths
Information Processing Letters
Integrated system interoperability testing with applications to VoIP
IEEE/ACM Transactions on Networking (TON)
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Path assignment for virtual circuit routing
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Modeling I/O systems with dynamic path selection, and general transmission networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Information and Computation
Linkless symmetric drawings of series parallel digraphs
Computational Geometry: Theory and Applications
Concurrency control and integrity preservation for the `RIM' DBMS
ACM SIGMIS Database
Five, Six, and Seven-Term Karatsuba-Like Formulae
IEEE Transactions on Computers
Design of a production system for cognitive modeling
ACM SIGART Bulletin
Sequencing of Configuration Operations for IP Networks
LISA '00 Proceedings of the 14th USENIX conference on System administration
Dynamic coverage in ad-hoc sensor networks
Mobile Networks and Applications
Weak minimization of DFA: an algorithm and applications
Theoretical Computer Science - Implementation and application of automata
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
IEEE/ACM Transactions on Networking (TON)
Three mysteries of Gaussian elimination
ACM SIGNUM Newsletter
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
A grading dilemma or the abyss between sorting and the knapsack problem
Journal of Computing Sciences in Colleges
A modular integer GCD algorithm
Journal of Algorithms
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Computing transitive closure on systolic arrays of fixed size
Distributed Computing
An efficient data structure for branch-and-bound algorithm
Information Sciences—Informatics and Computer Science: An International Journal
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
A Coarse-Grained multicomputer algorithm for the detection of repetitions
Information Processing Letters
Distributed evaluation of generalized path queries
Proceedings of the 2005 ACM symposium on Applied computing
Transformational Derivation of an Improved Alias Analysis Algorithm
Higher-Order and Symbolic Computation
Simpler and more general minimization for weighted finite-state automata
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Architecture-aware classical Taylor shift by 1
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Encyclopedia of Computer Science
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
GCHL: A grid-clustering algorithm for high-dimensional very large spatial data bases
Pattern Recognition Letters
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
Mining tree queries in a graph
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Approximate recognition of non-regular languages by finite automata
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
On Visualization and Aggregation of Nearest Neighbor Classifiers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Software Model Checking: The VeriSoft Approach
Formal Methods in System Design
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics
Formal Methods in System Design
ACM SIGSAM Bulletin
A comparative study of algorithms for sparse polynomial multiplication
ACM SIGSAM Bulletin
Course outline: Yale University, New Haven
ACM SIGSAM Bulletin
More on computing roots of integers
ACM SIGSAM Bulletin
Computer symbolic math & education: a radical proposal
ACM SIGSAM Bulletin
Representing matrices as quadtrees for parallel processors: extended abstract
ACM SIGSAM Bulletin
Placement of proxy-based multicast overlays
Computer Networks: The International Journal of Computer and Telecommunications Networking
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
Teaching quality object-oriented programming
Journal on Educational Resources in Computing (JERIC)
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
A Genetic Engineering Approach to Genetic Algorithms
Evolutionary Computation
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Speeding up the primal simplex algorithm on parallel computer
ACM SIGMAP Bulletin
Reconfiguration Algorithms for Power Efficient VLSI Subarrays with Four-Port Switches
IEEE Transactions on Computers
Mathematical framework for representing discrete functions as word-level polynomials
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
EURASIP Journal on Wireless Communications and Networking
Efficient inference control for range SUM queries on statistical data bases
SSDBM'81 Proceedings of the 1st LBL Workshop on Statistical database management
Hyperspace Geography: Visualizing Fitness Landscapes beyond 4D
Artificial Life
An O(n3log logn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
More efficient on-the-fly LTL verification with Tarjan's algorithm
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
Border array on bounded alphabet
Journal of Automata, Languages and Combinatorics
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
Two flow network simplification algorithms
Information Processing Letters
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science - Parameterized and exact computation
Proceedings of the 2006 ACM symposium on Applied computing
ACM Transactions on Mathematical Software (TOMS)
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science
Implementation techniques for fast polynomial arithmetic in a high-level programming environment
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Multiple serial episodes matching
Information Processing Letters
Fast partial evaluation of pattern matching in strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the cost of searching signature trees
Information Processing Letters
Automatic generation of test cases from Boolean specifications using the MUMCUT strategy
Journal of Systems and Software
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Journal of Systems and Software
The p-sized partitioning algorithm for fast computation of factorials of numbers
The Journal of Supercomputing
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
The Journal of Supercomputing
Power domination in block graphs
Theoretical Computer Science
Data Replication for Improving Data Accessibility in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
Integrated design of workcells and unidirectional flowpath layout
Computers and Industrial Engineering - Special issue: Computational intelligence and information technology applications to industrial engineering selected papers from the 33 rd ICC&IE
Algorithm for generating a step matrix by permutation
ACM SIGNUM Newsletter
Enumerating consistent metaquery instantiations
AI Communications
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Two-tier authentication for cluster and individual sets in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A clustering algorithm based on maximal θ-distant subtrees
Pattern Recognition
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Nonlinear automata over a finite ring
Cybernetics and Systems Analysis
The Journal of Supercomputing
Cut scheduling in the apparel industry
Computers and Operations Research
Domination analysis for minimum multiprocessor scheduling
Discrete Applied Mathematics
Jebelean--Weber's algorithm without spurious factors
Information Processing Letters
Smoothed analysis of binary search trees
Theoretical Computer Science
Optimal top-down join enumeration
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast Lagrange--Newton transformations
Journal of Complexity
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Experiments in Cost Analysis of Java Bytecode
Electronic Notes in Theoretical Computer Science (ENTCS)
Complementation of rational sets on scattered linear orderings of finite rank
Theoretical Computer Science
On the range maximum-sum segment query problem
Discrete Applied Mathematics
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Turing award lectures
An overview of computational complexity
ACM Turing award lectures
Ockham's razor, empirical complexity, and truth-finding efficiency
Theoretical Computer Science
A sophisticate's introduction to database normalization theory
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Virtual hashing: a dynamically changing hashing
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Equivalence among relational expressions with the union and difference operation
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Towards a universal relation interface
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Two-phase deadlock detection algorithm in distributed databases
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Join graphs and acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Scheduling of page-fetches in join operations
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Fixed points in discrete models for regulatory genetic networks
EURASIP Journal on Bioinformatics and Systems Biology
Path constraints in semistructured data
Theoretical Computer Science
A new approach to construct near-optimal binary search trees using genetic algorithm
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Efficient On-Line Proofs of Equalities and Inequalities of Formulas
IEEE Transactions on Computers
Tours of Graphs, Digraphs, and Sequential Machines
IEEE Transactions on Computers
Performance Evaluation of the Computer Network Dynamic Congestion Table Algorthm
IEEE Transactions on Computers
A Switch-Level Model and Simulator for MOS Digital Systems
IEEE Transactions on Computers
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Deadlock-Free Systems for a Bounded Number of Processes
IEEE Transactions on Computers
A Combinatorial Limit to the Computing Power of VLSI Circuits
IEEE Transactions on Computers
On Minimal Test Sets for Locating Single Link Failures in Networks
IEEE Transactions on Computers
MP/C: A Multiprocessor/Computer Architecture
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
The Complexity of Fault Detection Problems for Combinational Logic Circuits
IEEE Transactions on Computers
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers
Matrix Processors Using p-adic Arithmetic for Exact Linear Computations
IEEE Transactions on Computers
Trace Scheduling: A Technique for Global Microcode Compaction
IEEE Transactions on Computers
High-Speed Multiprocessors and Compilation Techniques
IEEE Transactions on Computers
An Improved Distribution Algorithm for Shortest Paths Problem
IEEE Transactions on Computers
A Layout System for the Random Logic Portion of an MOS LSI Chip
IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
A Distributed Algorithm for Shortest Paths
IEEE Transactions on Computers
Set Membership Classification: A Unified Approach to Geometric Intersection Problems
IEEE Transactions on Computers
Performance of a Simulated Dataflow Computer
IEEE Transactions on Computers
Content-Addressable Read/Write Memories for Image Analysis
IEEE Transactions on Computers
On the Computational Complexity of System Diagnosis
IEEE Transactions on Computers
Wavefront Array Processor: Language, Architecture, and Applications
IEEE Transactions on Computers
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
IEEE Transactions on Computers
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IEEE Transactions on Computers
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors
IEEE Transactions on Computers
On the Computational Complexity of a Generalized Scheduling Problem
IEEE Transactions on Computers
An Optimal Illumination Region Algorithm for Convex Polygons
IEEE Transactions on Computers
Digital Convolution Algorithm for Pipelining Multiprocessor Systems
IEEE Transactions on Computers
Manipulating sets in common Lisp
ACM SIGPLAN Lisp Pointers
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
Subcubic algorithms for recursive state machines
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Algorithms (TALG)
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Journal of Symbolic Computation
An experimental study of four typical test suite reduction techniques
Information and Software Technology
HPM: a hierarchical model for parallel computations
International Journal of High Performance Computing and Networking
Computers and Operations Research
Reconstruction of a graph from 2-vicinities of its vertices
Discrete Applied Mathematics
On complexity of optimal recombination for binary representations of solutions
Evolutionary Computation
Removing useless variables in cost analysis of Java bytecode
Proceedings of the 2008 ACM symposium on Applied computing
Country wise classification of human names
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms
RAM Simulation of BGS Model of Abstract-state Machines
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimization of markers in clothing industry
Engineering Applications of Artificial Intelligence
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Some competition programming problems as the beginning of artificial intelligence
Informatics in education
OLTP through the looking glass, and what we found there
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Making a case for situation-dependent user profiles in context-aware environments
Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
Fractal model for blood flow in cardiovascular system
Computers in Biology and Medicine
Canonical labeling of regular graphs in linear average time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The average complexity of deterministic and randomized parallel comparison sorting algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Multiplicative complexity of polynomial multiplication over finite fields
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Some polynomial and Toeplitz matrix computations
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Hierarchical memory with block transfer
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Computational complexity of sentences over fields
Information and Computation
Faster symmetry discovery using sparsity of symmetries
Proceedings of the 45th annual Design Automation Conference
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
ON DATA STRUCTURES FOR ASSOCIATION RULE DISCOVERY
Applied Artificial Intelligence
Mathematical Structures in Computer Science
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$
Cybernetics and Systems Analysis
Time-varying Reeb graphs for continuous space--time data
Computational Geometry: Theory and Applications
The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
Computational Geometry: Theory and Applications
Efficient Adaptive In-Place Radix Sorting
Informatica
The problem of the moody chess players
Information Processing Letters
SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
On Logic with Fuzzy and Rough Powerset Monads
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Comprehensive isomorphic subtree enumeration
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
A self-stabilizing algorithm for the st-order problem
International Journal of Parallel, Emergent and Distributed Systems
Analysis of a class of easily computable permutations
Cybernetics and Systems Analysis
Optimal vertex ranking of block graphs
Information and Computation
Reverse shortest path for dataflow optimization of hierarchically structure data networks
WSEAS TRANSACTIONS on COMMUNICATIONS
The unpredictable deviousness of models
Theoretical Computer Science
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Preferential Regular Path Queries
Fundamenta Informaticae
Journal of Experimental Algorithmics (JEA)
CARGuide: on-board computer for automobile route guidance
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Highly parallel associative search and its application to cellular database machine design
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Extracting unique rows of a bounded degree array using tries
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Applications of SIMD computers in signal processing
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
A new constrained edit distance between quotiented ordered trees
Journal of Discrete Algorithms
Parameterized Graph Cleaning Problems
Graph-Theoretic Concepts in Computer Science
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream
New Frontiers in Applied Data Mining
A survey of three-dimensional automata
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Efficient serial episode mining with minimal occurrences
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Regular-expression derivatives re-examined
Journal of Functional Programming
Mathematics and Computers in Simulation
How Efficient Can Memory Checking Be?
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Decision Problems for Convex Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms (TALG)
Fast connected-component labeling
Pattern Recognition
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Test Points Selection for Analog Fault Dictionary Techniques
Journal of Electronic Testing: Theory and Applications
Direct model checking matrix algorithm
Journal of Computer Science and Technology
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
Fast algorithms for multivariate interpolation and evaluation at special points
Journal of Complexity
Algorithms for near solutions to polynomial equations
Journal of Symbolic Computation
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
Unary finite automata vs. arithmetic progressions
Information Processing Letters
Adaptive Fault Tolerance for Scalable Cluster Computing in Space
International Journal of High Performance Computing Applications
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Processing an Offline Insertion-Query Sequence with Applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Toward an Automatic Approach to Greedy Algorithms
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Online data storage using implicit security
Information Sciences: an International Journal
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
Secret image sharing based on cellular automata and steganography
Pattern Recognition
Efficient Suboptimal Graph Isomorphism
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Parameterized graph cleaning problems
Discrete Applied Mathematics
Distinguishable entities: definition and properties
ENLG '09 Proceedings of the 12th European Workshop on Natural Language Generation
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Packet pacing in small buffer optical packet switched networks
IEEE/ACM Transactions on Networking (TON)
The Double Digest Problem: finding all solutions
International Journal of Bioinformatics Research and Applications
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Inductive learning of categories from examples using minimum cost representations
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
The complexity of searching several classes of AND/OR graphs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Stereo by two-level dynamic programming
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
An algebraic approach to constraint satisfaction problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Solving time-dependent planning problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
The trailblazer search with a hierarchical abstract map
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An algebraic foundation for truth maintenance
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Detecting palindromes, patterns and borders in regular languages
Information and Computation
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Algorithm 898: Efficient multiplication of dense matrices over GF(2)
ACM Transactions on Mathematical Software (TOMS)
On optimum choice of k in nearest neighbor classification
Computational Statistics & Data Analysis
Placement of proxy-based multicast overlays
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Placement algorithms for custom VLSI
Computer-Aided Design
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
Improved polynomial algorithms for robust bottleneck problems with interval data
Computers and Operations Research
IEEE Transactions on Signal Processing
A semi-dynamic multiple watermarking schemefor java applications
Proceedings of the nineth ACM workshop on Digital rights management
XPay: practical anonymous payments for tor routing and other networked services
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Parallel image processing with the block data parallel architecture
IBM Journal of Research and Development
The history of language processor technology in IBM
IBM Journal of Research and Development
On row-by-row coding for 2-D constraints
IEEE Transactions on Information Theory
Optimization of data-flow computations using canonical TED representation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
On finding fundamental cut sets
Information Processing Letters
Composing Partially Ordered Monads
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Fast enumeration of run-length-limited words
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy Sets and Systems
The problem of space invariance for sequential machines
Information and Computation
Two dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
Information Processing Letters
A Coarse-Grained Multicomputer algorithm for the detection of repetitions
Information Processing Letters
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
Multiple serial episodes matching
Information Processing Letters
Two flow network simplification algorithms
Information Processing Letters
Cellular d-graph automata with augmented memory
Information Sciences: an International Journal
Algorithms for permutation channel routing
Integration, the VLSI Journal
Partitioning and ordering of CMOS circuits for switch level analysis
Integration, the VLSI Journal
Integration, the VLSI Journal
A modular integer GCD algorithm
Journal of Algorithms
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Highly parallel rate-distortion optimized intra-mode decision on multicore graphics processors
IEEE Transactions on Circuits and Systems for Video Technology
Behavior detection using confidence intervals of hidden Markov models
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Feasibility of semiring-based timing constraints
ACM Transactions on Embedded Computing Systems (TECS)
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
An efficient algorithm for multivariate Maclaurin-Newton transformation
Annales UMCS, Informatica
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
A Control Theory for Boolean Monomial Dynamical Systems
Discrete Event Dynamic Systems
Purely functional 1-2 brother trees
Journal of Functional Programming
Finite-state machine based distributed framework DATA for intelligent ambience systems
CIMMACS'09 Proceedings of the 8th WSEAS International Conference on Computational intelligence, man-machine systems and cybernetics
Recursive formulation of the matrix Padé approximation in packed storage
Computers & Mathematics with Applications
Graph-theoretic properties in computational complexity
Journal of Computer and System Sciences
Journal of Computer and System Sciences
NP-complete scheduling problems
Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
On batch scheduling of jobs with stochastic service times and cost structures on a single server
Journal of Computer and System Sciences
The lex game and some applications
Journal of Symbolic Computation
More concise representation of regular languages by automata and regular expressions
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A parallel algorithm for the enumeration of the spanning trees of a graph
Parallel Computing
Paper: Parallel computation of matchings in trees
Parallel Computing
Short Communication: An efficient parallel algorithm for multiselection
Parallel Computing
Query by diagram: A fully visual query system
Journal of Visual Languages and Computing
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Incremental cryptography and memory checkers
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Suffix trees and string complexity
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Batch Diffie-Hellmam key agreement systems and their application to portable communications
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Counting the number of points on elliptic curves over finite fields: strategies and performances
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Efficient algorithm for checking multiplicity equivalence for the finite Z - Σ*-automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Tensegrity frameworks in one-dimensional space
European Journal of Combinatorics
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A polynomial time algorithm for left [right] local testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Backdoor attacks on black-box ciphers exploiting low-entropy plaintexts
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Algorithms for all-pairs reliable quickest paths
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Automatic remote-sensing images registration by matching close-regions
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The interprocedural express-lane transformation
CC'03 Proceedings of the 12th international conference on Compiler construction
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A light-weight algorithm for model checking with symmetry reduction and weak fairness
SPIN'03 Proceedings of the 10th international conference on Model checking software
A test points selection method for analog fault dictionary techniques
Analog Integrated Circuits and Signal Processing
Experience management: foundations, development methodology, and internet-based applications
Experience management: foundations, development methodology, and internet-based applications
Hit-list worm detection and bot identification in large networks using protocol graphs
RAID'07 Proceedings of the 10th international conference on Recent advances in intrusion detection
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Ant-MST: an ant-based minimum spanning tree for gene expression data clustering
PRIB'07 Proceedings of the 2nd IAPR international conference on Pattern recognition in bioinformatics
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Clustering XML documents based on structural similarity
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
r-semi-groups: a generic approach for designing stabilizing silent tasks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Topology-aware replica placement in fault-tolerant embedded networks
ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
Engineering burstsort: towards fast in-place string sorting
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Improved stage 2 to P ± 1 factoring algorithms
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Partially ordered monads and rough sets
Transactions on rough sets VIII
Oblivious RAMs without cryptogrpahic assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Learning computer programming: Implementing a fractal in a Turing Machine
Computers & Education
On the Topology of Discrete Strategies
International Journal of Robotics Research
Output-sensitive algorithm for the edge-width of an embedded graph
Proceedings of the twenty-sixth annual symposium on Computational geometry
Computing longest common substrings via suffix arrays
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A low complexity probabilistic test for integer multiplication
Journal of Complexity
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Building scalable virtual routers with trie braiding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Synchronized alternating turing machines on four-dimensional input tapes
WSEAS Transactions on Computers
WSEAS Transactions on Computers
Journal of Computing Sciences in Colleges
Synthesizing algorithms with performance constraints
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The satisfiability of temporal constraint networks
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
An efficient P2P content distribution system based on altruistic demand and recoding dissemination
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
Synthesizing algorithms with performance constraints
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The satisfiability of temporal constraint networks
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
On the complexity of monotonic inheritance with roles
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Learning abstraction hierarchies for problem solving
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Integrating metric and qualitative temporal reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
On the complexity of domain-independent planning
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Building the minimal automaton of A*X in linear time, when X is of bounded cardinality
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
A low-power high-data-rate ASK IF receiver with a digital-control AGC loop
IEEE Transactions on Circuits and Systems II: Express Briefs
The calculation of the degree of an approximate greatest common divisor of two polynomials
Journal of Computational and Applied Mathematics
O((log n)2) time online approximation schemes for bin packing and subset sum problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Average case analysis of algorithms
Algorithms and theory of computation handbook
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
The design of core 2: a library for exact numeric computation in geometry and algebra
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
An authorization framework resilient to policy evaluation failures
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
An algorithmic comparison of three scientific impact indices
Acta Cybernetica
A knowledge representation scheme for DFT
ITC'88 Proceedings of the 1988 international conference on Test: new frontiers in testing
Detection of access control flaws in a distributed database system with local site autonomy
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A Systolic Design for Connectivity Problems
IEEE Transactions on Computers
Finding Rectangle Intersections by Divide-and-Conquer
IEEE Transactions on Computers
Systolic VLSI Arrays for Polynomial GCD Computation
IEEE Transactions on Computers
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
Fast bit-parallel matching for network and regular expressions
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Searching the searchers with searchaudit
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Closed-Form Upper Bounds in Static Cost Analysis
Journal of Automated Reasoning
Fast enumeration algorithm for words with given constraints on run lengths of ones
Problems of Information Transmission
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Building species trees from larger parts of phylogenomic databases
Information and Computation
Decision problems for convex languages
Information and Computation
Fair and dynamic proofs of retrievability
Proceedings of the first ACM conference on Data and application security and privacy
Constructing the Bayesian network structure from dependencies implied in multiple relational schemas
Expert Systems with Applications: An International Journal
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Cryptovirology: extortion-based security threats and countermeasures
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Orientable edge colorings of graphs
Discrete Applied Mathematics
Exponential time improvement for min-wise based algorithms
Information and Computation
Deciding the isomorphism problem in classes of unary automatic structures
Theoretical Computer Science
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Designing via-configurable logic blocks for regular fabric
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
New complexity results for the k-covers problem
Information Sciences: an International Journal
Prenominal modifier ordering in bengali text generation
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Counting spanning trees in graphs using modular decomposition
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
A PSO based multi-robot task allocation
International Journal of Computational Vision and Robotics
Simultaneous modular reduction and Kronecker substitution for small finite fields
Journal of Symbolic Computation
Voronoi graph matching for robot localization and mapping
Transactions on computational science IX
Quadtree representation and compression of spatial data
Transactions on rough sets XIII
Voronoi graph matching for robot localization and mapping
Transactions on computational science IX
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Secure computation with information leaking to an adversary
Proceedings of the forty-third annual ACM symposium on Theory of computing
Normalization of row reduced matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Computers and Operations Research
Computing the longest common substring with one mismatch
Problems of Information Transmission
Commutative version of the local Hamiltonian problem and common eigenspace problem
Quantum Information & Computation
A universal flying amorphous computer
UC'11 Proceedings of the 10th international conference on Unconventional computation
Compositional failure detection in structured transition systems
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Information extraction from semi-structured resources: a two-phase finite state transducers approach
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Decidability and shortest strings in formal languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure
Journal of Mathematical Modelling and Algorithms
Acceleration of the inversion of triangular Toeplitz matrices and polynomial division
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Algorithms (TALG)
A sketch-based articulated figure animation tool
Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment
On stable multi-agent behavior in face of uncertainty
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
A polynomial-time algorithm for deciding Markov equivalence of directed cyclic graphical models
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Modus ponens generating function in the class of ∧-valuations of plausibility
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Incremental dynamic construction of layered polytree networks
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Cost analysis of object-oriented bytecode programs
Theoretical Computer Science
CLINCH: clustering incomplete high-dimensional data for data mining application
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Computing transitive closure problem on linear systolic array
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
How much information do software metrics contain?
Proceedings of the 3rd ACM SIGPLAN workshop on Evaluation and usability of programming languages and tools
Classification using scale and rotation tolerant shape signatures from convex hulls
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
One-Dimensional finger searching in RAM model revisited
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Size-Change termination and bound analysis
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Introducing a new variant of fast algebraic attacks and minimizing their successive data complexity
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Union-find with constant time deletions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An improved multi-stage (t, n)-threshold secret sharing scheme
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Design of robust vascular tree matching: validation on liver
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
Solving systems of differential equations of addition
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal seeding of self-reproducing systems
Artificial Life
Geist3D, a simulation tool for geometry-driven petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Satisfiability judgement under incomplete information
Transactions on Rough Sets XI
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On the general signature trees
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
A new related message attack on RSA
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Exponential time improvement for min-wise based algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
TreeCluster: clustering results of keyword search over databases
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Learnability of bipartite ranking functions
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Universally composable DKG with linear number of exponentiations
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Original article: A direct calculation of moments of the sample variance
Mathematics and Computers in Simulation
Algorithms for the edge-width of an embedded graph
Computational Geometry: Theory and Applications
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Pattern identification in biogeography
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A unifying framework for seed sensitivity and its application to subset seeds
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Fast algorithms for comparison of similar unordered trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Lookup table powered neural event-driven simulator
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Translational lemmas for alternating TMs and PRAMs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Updated data dissemination in ad hoc networks
UMICS'04 Proceedings of the Second CAiSE conference on Ubiquitous Mobile Information and Collaboration Systems
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Using fairness constraints in process-algebraic verification
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
A partially synchronizing coloring
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Symmetry and satisfiability: an update
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Equivalence and inclusion problem for strongly unambiguous büchi automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A new related message attack on RSA
Theoretical Computer Science
Progressive solutions: a simple but efficient dominance rule for practical RCPSP
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Simple O(m log n) time Markov chain lumping
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient algorithms for the 2-center problems
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
An algorithm for road coloring
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
DSOM'05 Proceedings of the 16th IFIP/IEEE Ambient Networks international conference on Distributed Systems: operations and Management
Larger automata and less work for LTL model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Linear time inference of strings from cover arrays using a binary alphabet
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
The derivational complexity of string rewriting systems
Theoretical Computer Science
A simple algorithm specification language and its application
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
The structure of online diffusion networks
Proceedings of the 13th ACM Conference on Electronic Commerce
Temporal query processing with indefinite information
Artificial Intelligence in Medicine
Automatic inference of resource consumption bounds
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient inclusion testing for simple classes of unambiguous ω-automata
Information Processing Letters
Recent developments in the theory of data structures
Computer Languages
Register allocation via coloring
Computer Languages
Generation of node lists using segment analysis
Computer Languages
Lenient evaluation is neither strict nor lazy
Computer Languages
A Scalable QoS-based inter-domain routing scheme in a high speed wide area network
Computer Communications
Dissemination of state information in distributed autonomous systems
Computer Communications
An optimal distributed algorithm for finding articulation points in a network
Computer Communications
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Parallel algorithms for some algebraic operations on polynomial equations
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
A new optimal algorithm for backbone topology design in communications networks
Mathematical and Computer Modelling: An International Journal
Efficient heuristic algorithms for path-based hardware/software partitioning
Mathematical and Computer Modelling: An International Journal
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
Operations Research Letters
Optimal assignment of mobile agents for software authorization and protection
Computer Communications
Research note: Cheater identification in (t,n) threshold scheme
Computer Communications
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Discrete Optimization
Detecting difference of usage of terms as difference of structure
Cognitive Systems Research
Tests for Permutation Functions
Finite Fields and Their Applications
A note on the factorization method of Niederreiter
Finite Fields and Their Applications
An experimental evaluation of weak-branch criterion for class testing
Journal of Systems and Software
Software development for reliable software systems
Journal of Systems and Software
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
A linear-time algorithm for solving continuous maximin knapsack problems
Operations Research Letters
Scheduling subject to nonrenewable-resource constraints
Operations Research Letters
Complexity of linear programming
Operations Research Letters
On the complexity of the one-terminal network design problem
Operations Research Letters
Fast algorithms for the maximum convolution problem
Operations Research Letters
Operations Research Letters
An optimal algorithm for 2 × n bottleneck transportation problems
Operations Research Letters
A note on resolving infeasibility in linear programs by constraint relaxation
Operations Research Letters
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Operations Research Letters
Computational experience with minimum spanning tree algorithms
Operations Research Letters
Guaranteed performance heuristics for the bottleneck travelling salesman problem
Operations Research Letters
A linear-time algorithm for classifying the states of a finite Markov chain
Operations Research Letters
Review of recent development: An O( n) algorithm for quadratic knapsack problems
Operations Research Letters
Approximation of the supply scheduling problem
Operations Research Letters
A fast algorithm for the linear multiple-choice knapsack problem
Operations Research Letters
Recognizing max-flow min-cut path matrices
Operations Research Letters
Scheduling with semaphore constraints
Operations Research Letters
Total domination in block graphs
Operations Research Letters
A linear-time median-finding algorithm for projecting a vector on the simplex of Rn
Operations Research Letters
A note on detecting simple redundancies in linear systems
Operations Research Letters
Operations Research Letters
Minimizing the density of terminal assignments in layout design
Operations Research Letters
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Algorithm for synthesis of real-time systems under reliability constraints
Journal of Computer and Systems Sciences International
CoPAn: exploring recurring patterns in conflict analysis of CDCL SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Improving the berlekamp algorithm for binomials xn-a
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
An algorithm for road coloring
Journal of Discrete Algorithms
Preferential Regular Path Queries
Fundamenta Informaticae
RAM Simulation of BGS Model of Abstract-state Machines
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Computing maximum hamiltonian paths in complete graphs with tree metric
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Fundamenta Informaticae
On Entropy and Optimal Coding Cost for Stochastic Language
Fundamenta Informaticae
Formal Verification and Diagnosis of Combinational Circuit Designs with Propositional Logic
Fundamenta Informaticae
Computing regularities in strings: A survey
European Journal of Combinatorics
Complexity Issues in Computational Biology
Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
On the representations of NC and log-space real numbers
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Implementing computations in automaton (semi)groups
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Parameterized domination in circle graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Efficient trie braiding in scalable virtual routers
IEEE/ACM Transactions on Networking (TON)
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Page Number and Graph Treewidth
International Journal of Applied Metaheuristic Computing
Confidentiality for probabilistic multi-threaded programs and its verification
ESSoS'13 Proceedings of the 5th international conference on Engineering Secure Software and Systems
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Fun with semirings: a functional pearl on the abuse of linear algebra
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Wireless Personal Communications: An International Journal
Neighborhood-Preserving mapping between trees
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Faster reaction mapping through improved naming techniques
Journal of Experimental Algorithmics (JEA)
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
Distribution-based query scheduling
Proceedings of the VLDB Endowment
Taupe: Visualizing and analyzing eye-tracking data
Science of Computer Programming
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Counter strike: generic top-down join enumeration for hypergraphs
Proceedings of the VLDB Endowment
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
Computational Mathematics and Modeling
Practical graph isomorphism, II
Journal of Symbolic Computation
A memory access model for highly-threaded many-core architectures
Future Generation Computer Systems
Fast matrix decomposition in F2
Journal of Computational and Applied Mathematics
A computational approach to construct a multivariate complete graph invariant
Information Sciences: an International Journal
Linear computation of unbordered conjugate on unordered alphabet
Theoretical Computer Science
Parameterized Domination in Circle Graphs
Theory of Computing Systems
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Journal of Combinatorial Optimization
Regular languages of partial words
Information Sciences: an International Journal
Hi-index | 1.14 |
From the Publisher:With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001