The following pages link to full work available at URL (P205):
Displaying 50 items.
- Domains of partial attributed tree transducers (Q294731) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- RNS architectures for the implementation of the `diagonal function' (Q294738) (← links)
- An improved testing scheme for catastrophic fault patterns (Q294739) (← links)
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
- Worst case examples for operations on OBDDs (Q294746) (← links)
- On finding medians of weighted discrete points (Q294747) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- A conservative scheme for parallel interval narrowing (Q294755) (← links)
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Statistical delay analysis on an ATM switch with self-similar input traffic (Q294764) (← links)
- On distribution properties of sequences with perfect linear complexity profile (Q294765) (← links)
- 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)
- 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)
