The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity (Q3747744) (← links)
- Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489) (← links)
- The Multi-Armed Bandit Problem: Decomposition and Computation (Q3755256) (← links)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- An overview of computational complexity (Q3759938) (← links)
- The m-dimensional grid point space (Q3759949) (← links)
- Computation of the incomplete gamma function ratios and their inverse (Q3761545) (← links)
- Reaching approximate agreement in the presence of faults (Q3763582) (← links)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms (Q3763585) (← links)
- Simulation of large networks on smaller networks (Q3763599) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- Every sequence is reducible to a random one (Q3764139) (← links)
- Beyond Floating Point (Q3765117) (← links)
- An End-to-End Approach to the Resequencing Problem (Q3765229) (← links)
- A Theory of Communicating Sequential Processes (Q3765233) (← links)
- On relativized exponential and probabilistic complexity classes (Q3765250) (← links)
- Smallest-last ordering and clustering and graph coloring algorithms (Q3765255) (← links)
- Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870) (← links)
- On Proving Limiting Completeness (Q3769943) (← links)
- The complexity of propositional linear temporal logics (Q3769957) (← links)
- Worst-case Analysis of Set Union Algorithms (Q3769963) (← links)
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem (Q3770262) (← links)
- On the efficiency of subsumption algorithms (Q3771609) (← links)
- A sufficient condition for backtrack-bounded search (Q3771663) (← links)
- Algorithm 654 (Q3774809) (← links)
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← links)
- The complexity of searching a graph (Q3777477) (← links)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940) (← links)
- The Complexity of Markov Decision Processes (Q3780028) (← links)
- An extended set of FORTRAN basic linear algebra subprograms (Q3780347) (← links)
- Minkowski's Convex Body Theorem and Integer Programming (Q3780763) (← links)
- Combinatorics, complexity, and randomness (Q3783491) (← links)
- A lower bound for probabilistic distributed algorithms (Q3783527) (← links)
- Min-max heaps and generalized priority queues (Q3783545) (← links)
- Efficient parallel algorithms for edge coloring problems (Q3783599) (← links)
- Updating conjugate directions by the BFGS formula (Q3783852) (← links)
- Solving Simultaneous Modular Equations of Low Degree (Q3783957) (← links)
- Boole-Bonferroni Inequalities and Linear Programming (Q3784915) (← links)
- Generality in artificial intelligence (Q3787425) (← links)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (Q3787914) (← links)
- The Notion of Security for Probabilistic Cryptosystems (Q3787915) (← links)
- An algorithm for finding hamilton cycles in random directed graphs (Q3790664) (← links)
- Solution to a linear diophantine equation for nonnegative integers (Q3791221) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- Monotone Bipartite Graph Properties are Evasive (Q3792707) (← links)
- A locally adaptive data compression scheme (Q3794067) (← links)
- Refining the Diffusion Approximation for the <i>M</i>/<i>G</i>/<i>m</i> Queue (Q3795030) (← links)
- The concave least-weight subsequence problem revisited (Q3796787) (← links)
- Probabilistic Inference and Influence Diagrams (Q3796955) (← links)
