The following pages link to zbMATH Open document ID (P225):
Displaying 50 items.
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- On the general classification of nonlinear filters of \(m\)-sequences (Q294660) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← 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)
- Meeting times of random walks on graphs (Q294672) (← links)
- A refinement of replacement selection (Q294674) (← links)
- On a question of nearly minimal identification of functions (Q294675) (← links)
- Exploiting intra-object dependencies in parallel simulation (Q294676) (← links)
- A versatile divide and conquer technique for optimal string alignment (Q294680) (← links)
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← 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)
- Christmas tree: a versatile 1-fault-tolerant design for token rings (Q294701) (← links)
- Very fast and simple approximate string matching (Q294703) (← links)
- Generating all the acyclic orientations of an undirected graph (Q294704) (← links)
- On inferring linear single-tree languages (Q294705) (← links)
- On the Day-Tripathi orientation of the star graphs: connectivity (Q294708) (← links)
- PACS, simple-PAC and query learning (Q294709) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← 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)
- Finding OR in a noisy broadcast network (Q294723) (← links)
- Pancyclicity in switching classes (Q294726) (← links)
- Liu and Layland's schedulability test revisited (Q294728) (← links)
- On spanning trees with restricted degrees (Q294729) (← 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)
- 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)
