Efficient Query Evaluation in Relational Data Bases with Missing Values.
On the Complexity of Inexact Computations.
RNS architectures for the implementation of the `diagonal function'.
A Characterization of Finitary Bisimulation.
On the Multiplication of Reduced Biquaternions and Applications.
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes.
An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function.
An Algorithm for Modular Exponentiation.
Binomial Coefficients with Non-Integral Lower Index.
An Example of a PD2L-System with the Growth Type 2½.
A Scheme for Fault-Tolerant Virtual Memory.
Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms.
Finding a Maximum Independent Set in a Permutation Graph.
Parallel Algorithms for the Segment Dragging Problem.
An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks.
Unambiguous Description of Chain Code Picture Languages.
A space- and time-efficient local-spin spin lock.
An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object.
Online deadline scheduling on faster machines.
An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs.
Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network.
Optimal Total Exchange for a 3-D Torus of Processors.
Coordinator: A Modification to the Monitor Concept.
A Mean Value Analysis of the Ethernet Throughput.
O(log n) Numerical Algorithms on a Mesh with Wormhole Routing.
Starvation-Free Secure Multiversion Concurrency Control.
Partial Sum Problem Mapping Into a Hypercube.
The FX Distribution Method for Parallel Processing of Partial Match Queries.
Two-Way Dominant Sequence Clustering for Processor Scheduling.
Simple Algorithms for Multiprocessor Scheduling to Meet Deadlines.
Deadline Scheduling of Tasks with Ready Times and Resource Constraints.
Personalized cache management for mobile computing environments.
A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence.
Cycle Detection in Critical Path Networks.
On classes of functions for which No Free Lunch results hold.
Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic.
Complexity of min-max subsequence problems.
Bounds on the Weighted Path Length of Binary Trees.
"Software Devices" for Processing Graphs Using PL/I Compile Time Facilities.
Removing edge-node intersections in drawings of graphs.
A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions.
The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs.
A Cascade Algorithm for the Logical Closure of a Set of Binary Relations.
A Predecessor Algorithm for Ordered Lists.
An ENA algorithm to enhance the performance of TCP over satellite links.
On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph.
Some Notes on Strong and Weak log log n Space Complexity.
A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments.
The Pagenumber of the Class of Bandwidth-k Graphs is k-1.
Safe Procedural Implementations of Algebraic Types.
Sending compressed messages to a learned receiver on a bidirectional line.
Computing Values of a Polynomial with Only few Multiplications.
Strong Equivalence of Relational Wxpressions Under Dependencies.
On the Calculation of Control Transition Probabilities in a Program.
Effects of broadcast errors on concurrency control in wireless broadcasting environments.
On the effective clustering of multidimensional data sequences.
The Power of Geometric Duality Revisited.
Grammar Coverings of a Deterministic Parser with Action Conflicts.
Integrating Authentication in Public Key Distribution System.
Authenticated Encryption Schemes with Linkage Between Message Blocks.
Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem.
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle.
Semantics and Properties of Existential Quantifiers in Deductive Databases.
Effects of Message Loss on the Termination of Distributed Protocols.
An efficient nearest neighbor search in high-dimensional data spaces.
Resolving all Deadlocks in Distributed Systems.
Characterization of Extended LR(k) Grammars.
The All Nearest-Neighbor Problem for Convex Polygons.
Parallel Batched Planar Point Location on the CCC.
The Length Sets of D0L Languages are Uniformly Bounded.
Linear systolic multiplier/squarer for fast exponentiation.
Location of Multiple Points in a Planar Subdivision.
A Dynamic Scheduling Algorithm for Large Scale Multimedia Servers.
Closed form bounds for clock synchronization under simple uncertainty assumptions.
An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys.
A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm.
The Complexity of Data Flow Criteria for Test Data Selection.
On a Stable Minimum Storage Merging Algorithm.
Solving the Hamiltonian cycle problem via an artificial neural network.
Deterministic Two-Way One-Head Pushdown Automata are Very Powerful.
Optimal reservation policy for two queues in tandem.
A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths.
Complexity of weak acceptance conditions in tree automata.
The Morse Sequence and Iterated Morphisms.
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets.
Optimality of Wait-Free Atomic Multiwriter Variables.
Traveling the Boundary of Minkowski Sums.
On the Minimal Number of * Operators to Model Regularity in Fair SCCS.
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs.
Relating Bends and Size in Orthogonal Graph Drawings.
Approximating the Diameter of a Set of Points in the Euclidean Space.
Constrained multi-object auctions and b-matching.
On the Closure of Triangle-Free Graphs Under Substitution.
On the approximability of two tree drawing conventions.
Comments on `Error Resynchronisation in Producer Consumer Systems'.
Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm.
Nonconstructive Advances in Polynomial-Time Complexity.
A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm.
On the Angle Restricted Nearest Neighbor Problem.
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Several Practical Protocols for Authentication and Key Exchange.
The Most Vital Edges in the Minimum Spanning Tree Problem.
The Computational Complexity of the Reliability Problem on Distributed Systems.
The computation of hitting sets: Review and new algorithms.
Resolving error propagation in distributed systems.
Minimal Fully Adaptive Wormhole Routing on Hypercubes.
Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time.
A Fast Parallel, Algorithm to Recognize, Partitionable Graphs.
Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs.
Approximation Algorithms for Geometric Median Problems.
Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length.
Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems.
Determining Connected Components in Linear Time by a linear Number of Processors.
Optimal Embedding of 2-D Torus Into Ring.
Characterizing the Regular Prefix Codes and Right Power-Bounded Languages.
On Pushout Consistency, Modularity and Interpolation for Logical Specifications.
An efficient algorithm for cyclic reference counting.
Cyclic Reference Counting with Lazy Mark-Scan.
Scheduling with job release dates, delivery times and preemption penalties.
An Algorithm for Testing Lossless Join Property in Relational Databases.
An Effecient Parallel Sorting Algorithm.
On Decomposing Polygons into Uniformly Monotone Parts.
An Implementation of a Nonlinear Skewing Scheme.
A Note on the Power of Integer Division.
A Note on Boolean Matrix Multiplication.
A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes.
Assessment of Data Redundancy in Fuzzy Relational Databases Based on Semantic Inclusion Degree.
The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching.
A New Upper Bound on the Complexity of Derivative Evaluation.
Understanding the Complexity of Interpolation Search.
Exact Computation of Steiner Minimal Trees in the Plane.
Comments on Convex Hull of a Finite Set of Points in Two Dimensions.
Efficient Test & Set Constructions for Faulty Shared Memory.
On a Cyclic String-To-String Correction Problem.
A Representation of Disjoint Sets with Fast Initialization.
The maximum f-depth spanning tree problem.
Differential approximation results for the traveling salesman and related problems.
Permutations Are Not Context-Free: An Application of the Interchange Lemma.
The Level-Ancestor problem on Pure Pointer Machines.
A Tool for the Analysis of Manipulation.
Complexity Versus Stability for Classes of Propositional Formulas.
A Study of Page Arrangements for Extendible Hashing.
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
A Note on the Descriptive Complexity of Maximization.
Digital signature algorithm for securing digital identities.
Erratum to: "Digital signature algorithm for securing digital identities": [Information Processing Letters 82 (2002) 247-252].
Study of Self-Organizing Heuristics for Skewed Access Patterns.
How to Prevent Interaction of Functional and Inclusion Dependencies.
Round-Optimal Perfect Zero-Knowledge Proofs.
New Statistics for Demand-Based Software Testing.
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation.
Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs.
An O(n log n) Algorithm for Finding Dissimilar Strings.
Tight Lower Bounds on the Length of Word Chains.
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.
On Linear-Time Algorithms for Five-Coloring Planar Graphs.
Self-Modifying Finite Automata: An Introduction.
Comments on ``Always-True is not Invariant'': Assertional Reasoning About Invariance.
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution.
Halfspace Learning, Linear Programming, and Nonmalicious Distributions.
On-Line Longest Fragment First Parsing Algorithm.
An Efficient Strategy for Robot Navigation in Unknown Environment.
A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem.
An Attack on the Needham-Schroeder Public-Key Authentication Protocol.
Lower Bounds of the Complexity of Linear Algebras.
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power.
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
Linear-Time Construction of Treaps and Cartesian Trees.
A Note on Construction of Treaps and Cartesian Trees.
Completeness Results Concerning Systolic Tree Automata and EOL Languages.
A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m.
Computing the Number of Mergings with Constraints.
A Practical Algorithm for Boolean Matrix Multiplication.
Uniform Generation of Forests of Restricted Height.
Transformational vs Reactive Refinement in Real-Time Systems.
Faster broadcasting in unknown radio networks.
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults.
Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment.
Graphs which Locally Mirror the Hypercube Structure.
Steiner trees in uniformly quasi-bipartite graphs.
A combinatorial characterization of regular anonymous perfect threshold schemes.
Synchronous Communication Between Asynchronous Components.
"Algorithms for On-the-Fly Garbage Collection" Revisited.
Inversion of a Recursive Tree Traversal.
Complexity of Solving Algebraic Equations.
The alpha-beta Algorithm: An Exercise in Program Transformation.
P_4-laden Graphs: A New Class of Brittle Graphs.
Verifying Programs by Induction on Their Data Structure: General Format and Applications.
A Combinatorial Property of the Fibonacci Words.
A Division Property of the Fibonacci Word.
Constructing the Visibility Graph for n-Line Segments in O(n²) Time.
Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines.
Optimality of Intuitive Checkpointing Policies.
Why is the 3D Delaunay Triangulation Difficult to Construct.
On the performance of the first-fit coloring algorithm on permutation graphs.
On the Number of Spanning Trees of Multi-Star Related Graphs.
Attacks on Okamoto and Tanaka's One-Way ID-Based Key Distribution System.
Efficient ID-Based Key Distribution with Tamperfree Devices.
On the Security of SPLICE/AS - The Authentication System in WIDE Internet.
Sequential construction of a circular consecutive-2 system.
Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders.
On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions.
On One Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations.
On an Approach to Integrating Boundary Problems With a Non-Unique Solution.
Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis.
Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion".
Iterative Methods for Solving Difference Equations of the Theory of Elasticity not Depending on the Spacing of the Difference Set.
On Hypergraph Acyclicity and Graph Chordality.
An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue.
A Fast Parallel Coloring of Planar Graphs with Five Colors.
Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables.