The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542) (← links)
- Fast solution of toeplitz systems of equations and computation of Padé approximants (Q3930541) (← links)
- A Sufficient Condition for Backtrack-Free Search (Q3933756) (← links)
- An Improved Algorithm for Computing the Singular Value Decomposition (Q3935379) (← links)
- An Efficient Unification Algorithm (Q3936229) (← links)
- Optimal Control of a Birth and Death Epidemic Process (Q3936552) (← links)
- Covering and packing in graphs IV: Linear arboricity (Q3936755) (← links)
- Kuratowski's theorem (Q3937423) (← links)
- On the Budan-Fourier controversy (Q3938430) (← links)
- A New Representation of the Rational Numbers for Fast Easy Arithmetic (Q3938491) (← links)
- The Byzantine Generals Problem (Q3942378) (← links)
- Computation of Matrix Chain Products. Part I (Q3942395) (← links)
- A weighted matroid intersection algorithm (Q3942972) (← links)
- Domination-balanced graphs (Q3950587) (← links)
- Poisson Arrivals See Time Averages (Q3951358) (← links)
- Irreducible polynomials with integral coefficients have succinct certificates (Q3951538) (← links)
- On the relationship between LL(1) and LR(1) grammars (Q3951573) (← links)
- Plane-sweep algorithms for intersecting geometric figures (Q3953198) (← links)
- Completions of Partially Ordered Sets (Q3955401) (← links)
- The Category-Theoretic Solution of Recursive Domain Equations (Q3956379) (← links)
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483) (← links)
- Asymptotically tight bounds on time-space trade-offs in a pebble game (Q3959426) (← links)
- The Byzantine generals strike again (Q3959472) (← links)
- On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458) (← links)
- Complete Convergence of Short Paths and Karp's Algorithm for the TSP (Q3960487) (← links)
- Optimal Auction Design (Q3960505) (← links)
- Bidirectional Heuristic Search Again (Q3962475) (← links)
- Fast quantizing and decoding and algorithms for lattice quantizers and codes (Q3962919) (← links)
- A Distributed Algorithm for Minimum-Weight Spanning Trees (Q3964023) (← links)
- On Additive Bases and Harmonious Graphs (Q3964614) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- On the complexity of the general coloring problem (Q3968465) (← links)
- The value of the stochastic solution in stochastic linear programs with fixed recourse (Q3968764) (← links)
- Minimization by Random Search Techniques (Q3968769) (← links)
- On-line algorithms for polynomially solvable satisfiability problems (Q3970696) (← links)
- Poisson approximation for large deviations (Q3977078) (← links)
- Acyclic coloring of graphs (Q3977081) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods (Q3978507) (← links)
- A Note on Planar Graphs and Circle Orders (Q3979445) (← links)
- On the Existence of a Feasible Flow in a Stochastic Transportation Network (Q3981512) (← links)
- Computationally Feasible Bounds for Partially Observed Markov Decision Processes (Q3981515) (← links)
- c-means clustering with the l/sub l/ and l/sub infinity / norms (Q3982611) (← links)
- Sensor array processing based on subspace fitting (Q3985193) (← links)
- Performance analysis of the total least squares ESPRIT algorithm (Q3985194) (← links)
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification (Q3985547) (← links)
- Noninteractive Zero-Knowledge (Q3985810) (← links)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
- Colliding stacks: A large deviations analysis (Q3986107) (← links)
- Sparse Matrices in MATLAB: Design and Implementation (Q3988993) (← links)
