The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- On synthesis of scheduling algorithms (Q799101) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- On the consecutive retrieval property for generalized binary queries (Q799135) (← links)
- Algebraic approach to p-adic conversion of rational numbers (Q799368) (← links)
- Some remarks on subclass containment problems for several classes of dpda's (Q799387) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- How evenly should one divide to conquer quickly? (Q800084) (← links)
- The complexity of incremental convex hull algorithms in \(R^ d\) (Q800085) (← links)
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- On the centers of the set of weakly square-free words on a two letter alphabet (Q800095) (← links)
- How to produce all sentences from a two-level grammar (Q800100) (← links)
- A 4n-lower bound on the monotone network complexity of a one-output Boolean function (Q800311) (← links)
- Throughput concavity and response time convexity (Q800726) (← links)
- An analytical comparison of two string searching algorithms (Q800732) (← links)
- On verification of programs with goto statements (Q801657) (← links)
- Some variants of the take-grant protection model (Q801669) (← links)
- Translation of Turner combinators in O(n log n) space (Q802308) (← links)
- Fairness and conspiracies (Q802310) (← links)
- The contour problem for rectilinear polygons (Q802313) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- Problem of optimizing the number of block accesses in performing relational join is NP-hard (Q808230) (← links)
- A div(n) depth Boolean circuit for smooth modular inverse (Q808255) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- A note on enumerative counting (Q809598) (← links)
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
- Fault-tolerant and flexible interconnection of multiple processors (Q811113) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance (Q811140) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- The super laceability of the hypercubes (Q834885) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Generalized honeycomb torus is Hamiltonian (Q834887) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- A symbolic approach for content-based information filtering (Q834890) (← links)
- Darts and hoopla board design (Q834892) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- A note on the oriented chromatic number of grids (Q834897) (← links)
- Oriented colorings of triangle-free planar graphs (Q834898) (← links)
- Some characterizations of Parikh matrix equivalent binary words (Q834899) (← links)
- A constructive proof for FLP (Q834901) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- A compression method for prefix-sum cubes (Q834909) (← links)
- A classification of tournaments having an acyclic tournament as a minimum feedback arc set (Q834910) (← links)
- Global roundings of sequences (Q834911) (← links)
