The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- A note on the complexity of local search problems (Q673814) (← links)
- The interval B-tree (Q673817) (← links)
- Several practical protocols for authentication and key exchange (Q673818) (← links)
- On the security of SPLICE/AS -- The authentication system in WIDE Internet (Q673820) (← links)
- Two attacks on Neuman-Stubblebine authentication protocols (Q673822) (← links)
- On the minimum diameter spanning tree problem (Q673823) (← links)
- An algorithm for dynamic data allocation in distributed systems (Q673824) (← links)
- Query processing for multimedia applications on optical media (Q673899) (← links)
- New statistics for demand-based software testing (Q673902) (← links)
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- An experiment with the use of predicate transformers in UNITY (Q673907) (← links)
- On the point-to-point connection problem (Q673909) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- The weakest deadlock-preserving congruence (Q673911) (← links)
- A new lower bound on the expected size of irredundant forms for Boolean functions (Q673913) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- On the security of the Lucas function (Q673987) (← links)
- Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems (Q673989) (← links)
- A note on recursive properties of the de Bruijn, Kautz and FFT digraphs (Q673992) (← links)
- An algorithm for FIFO message delivery among migrating tasks (Q673994) (← links)
- An efficient semantic evaluator for warped LC(1) attributed grammars (Q673997) (← links)
- Topological properties of the directional hypercube (Q673998) (← links)
- On the Modularization Theorem for logical specifications (Q674000) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- A polynomial bound on the number of light cycles in an undirected graph (Q674176) (← links)
- Separating collections of points in Euclidean spaces (Q674178) (← links)
- Training digraphs (Q674181) (← links)
- Generalized dominators (Q674182) (← links)
- Characteristic inequalities for binary trees (Q674183) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- A parallel algorithm for the minimum weighted vertex cover problem (Q674187) (← links)
- Corrigendum: Semi-unification of two terms in Abelian groups (Q674189) (← links)
- Sequential calculus (Q674261) (← links)
- Fixed-point calculus (Q674263) (← links)
- Constructing the Galois adjoint (Q674265) (← links)
- Heuristics for a calculational proof (Q674267) (← links)
- Equational propositional logic (Q674268) (← links)
- Mapping a functional notation for parallel programs onto hypercubes (Q674270) (← links)
- Constructing a program with exceptions (Q674271) (← links)
- Games and winning strategies (Q674272) (← links)
- On a question about learning nearly minimal programs (Q674285) (← links)
- A generalized notion of semantic independence (Q674287) (← links)
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
