The following pages link to zbMATH Open document ID (P225):
Displaying 50 items.
- Dynamic suffix tree and two-dimensional texts management (Q287000) (← links)
- Connectivity of the crossed cube (Q287002) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Distributed enumeration (Q287005) (← links)
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- Disjoint Hamiltonian cycles in recursive circulant graphs (Q287012) (← links)
- A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
- Approximate center points in dense point sets (Q287016) (← links)
- A tight lower bound for top-down skew heaps (Q287017) (← links)
- On a geometric problem of zigzags. (Q287020) (← links)
- Computing kernels in directed bichromatic graphs (Q287022) (← links)
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Analysis of the Hilbert curve for representing two-dimensional space (Q287025) (← links)
- Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
- Mutex needs fairness (Q287028) (← links)
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters (Q287032) (← links)
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions (Q287037) (← links)
- Shared authentication token secure against replay and weak key attacks (Q287040) (← links)
- Area requirement of visibility representations of trees (Q287042) (← links)
- An improved deterministic algorithm for generating different many-element random samples (Q287046) (← links)
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- The strong equivalence of ET0L grammars (Q287052) (← links)
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Complexity and dimension (Q287068) (← links)
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- An optimal algorithm for realizing a Delaunay triangulation (Q287080) (← links)
- On the Clark-Jacob version of SPLICE/AS (Q287082) (← links)
- On keys and normal forms (Q287084) (← links)
- Compressibility and uniform complexity (Q287086) (← links)
- On decision trees for orthants (Q287088) (← links)
- A verification algorithm for inheritance hierarchies in object-oriented databases (Q287091) (← links)
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
- A note on optical routing on trees (Q287098) (← links)
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- Systematic debugging method for attribute grammar description (Q287103) (← links)
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
