The following pages link to OpenAlex ID (P388):
Displaying 50 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- On detecting spatial regularity in noisy images (Q294654) (← links)
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- A parallel approach to direct analog-to-residue conversion (Q294665) (← links)
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- A refinement of replacement selection (Q294674) (← links)
- Exploiting intra-object dependencies in parallel simulation (Q294676) (← links)
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- Common modulus and chosen-message attacks on public-key schemes with linear recurrence relations (Q294688) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Regularity of normed PA processes (Q294692) (← links)
- Assessment of data redundancy in fuzzy relational databases based on semantic inclusion degree (Q294693) (← links)
- Estimating the range of a function in an online setting (Q294695) (← links)
- A new one pass algorithm for estimating stochastic context-free grammars (Q294698) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- PACS, simple-PAC and query learning (Q294709) (← links)
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- Error-detecting codes and fault-containing self-stabilization (Q294717) (← links)
- On the geometry of similarity search: dimensionality curse and concentration of measure (Q294719) (← links)
- On-line scheduling with setup costs (Q294721) (← links)
- Pancyclicity in switching classes (Q294726) (← links)
- Liu and Layland's schedulability test revisited (Q294728) (← links)
- A note on ``Category and measure in complexity classes'' (Q294730) (← links)
- 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)
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Statistical delay analysis on an ATM switch with self-similar input traffic (Q294764) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← 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)
- 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)
- A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
