The following pages link to title (P159):
Displaying 50 items.
- Triangulations without minimum-weight drawing (Q294766) (← links)
- A note on the spectral characterization of correlation immune Boolean functions (Q294767) (← links)
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Randomized uniform self-stabilizing mutual exclusion (Q294769) (← links)
- A concept-based query evaluation with indefinite fuzzy triples (Q294770) (← links)
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- On secret set schemes (Q294774) (← links)
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- Resolving error propagation in distributed systems (Q294777) (← links)
- Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness'' (Q294778) (← links)
- Quorums from difference covers (Q294779) (← links)
- Gödelization in the lambda calculus (Q294781) (← links)
- Abstracting numeric constraints with Boolean functions (Q294784) (← links)
- Cyclic-cubes and wrap-around butterflies (Q294788) (← links)
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- On the optimal utilization of all available states in the \(2^{n}\) moduli set (Q294795) (← links)
- Improved bounds for dictionary look-up with one error (Q294796) (← links)
- Exact solution of a minimal recurrence (Q294799) (← links)
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- On edge-disjoint spanning trees with small depths (Q294801) (← links)
- A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804) (← links)
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- A new universal and fault-tolerant quantum basis (Q294808) (← links)
- How rich is the structure of the intrinsic complexity of learning (Q294809) (← links)
- Computational complexity of similarity retrieval in a pictorial database (Q294810) (← links)
- On the computational power of linearly transformed BDDs (Q294813) (← links)
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- Security of Tseng-Jan's group signature schemes (Q294825) (← links)
- \textit{plapackJava}: towards an efficient Java interface for high performance parallel linear algebra (Q294827) (← links)
- Efficient construction of vote-tags to allow open objection to the tally in electronic elections (Q294830) (← links)
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Sequential construction of a circular consecutive-2 system (Q294833) (← links)
- Solving the Hamiltonian cycle problem via an artificial neural network (Q294834) (← links)
- A fast algorithm for computing large Fibonacci numbers (Q294835) (← links)
- Response time behavior of distributed voting algorithms for managing replicated data (Q294838) (← links)
- Visual cryptography for grey level images (Q294839) (← links)
- A note on a question of Peled and Wilke regarding stutter-invariant LTL (Q294841) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Feedback vertex set in hypercubes (Q294845) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Enumeration of lattice points in \(l_1\) norm (Q294849) (← links)
- Random duplicate storage strategies for load balancing in multimedia servers (Q294850) (← links)
- On the linear complexity of the sequences generated by nonlinear filterings (Q294851) (← links)
- Deterministic small-world communication networks (Q294854) (← links)
- Evolutionary graph colouring (Q294858) (← links)
- Linear complexity of the Naor-Reingold pseudo-random function (Q294859) (← links)
