The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Minimal storage representations for binary relations (Q789170) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- Grammatical unification (Q789185) (← links)
- On the structure of \(\Delta_ 2\!^ p\) (Q789386) (← links)
- Performance evaluation of concurrent systems using Petri nets (Q789900) (← links)
- A counter example to a monotonicity property of k-d trees (Q789903) (← links)
- Minimum vertex distance between separable convex polygons (Q789904) (← links)
- A measure in which Boolean negation is exponentially powerful (Q790083) (← links)
- Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort (Q790618) (← links)
- On legal path problems in digraphs (Q790621) (← links)
- On a circle-cover minimization problem (Q790622) (← links)
- A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (Q791323) (← links)
- On the size of projections: I (Q791330) (← links)
- On the 'correct prefix property' in precedence parsers (Q792099) (← links)
- Remarks on two-way automata with weak-counters (Q793509) (← links)
- A note on array grammars (Q793512) (← links)
- A priority queue for the all pairs shortest path problem (Q794155) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- A note on border rank (Q794161) (← links)
- A decision procedure for optimal polyhedron partitioning (Q794166) (← links)
- A probabilistic lower bound for checking disjointness of sets (Q794167) (← links)
- Strong NP-hardness of moving many discs (Q794168) (← links)
- On the power of real-time two-way multihead finite automata with jumps (Q794171) (← links)
- Stability of desynchronized 0L-systems (Q794173) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- When do non-conflict-free multivalued dependency sets appear? (Q794181) (← links)
- Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
- Programmed deallocation without dangling reference (Q794425) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- On computing the determinant in small parallel time using a small number of processors (Q794429) (← links)
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- A storage-size selection problem (Q795502) (← links)
- The critical complexity of graph properties (Q795503) (← links)
- An O(n log n) Manhattan path algorithm (Q795510) (← links)
- Approximating block accesses in database organizations (Q795517) (← links)
- Area-time tradeoff for rectangular matrix multiplication in VLSI models (Q796300) (← links)
- On converting character strings to integers (Q796969) (← links)
- A proof of the determinacy property of the data flow schema (Q796973) (← links)
- Extension of the Banker's algorithm for resource allocation in a distributed operating system (Q796982) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Functional dependencies in relations with null values (Q797002) (← links)
- Multiserialization of iterated transactions (Q797005) (← links)
- Erratum to ``On the 'correct prefix property' in precedence parsers'' (Q797299) (← links)
- Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures'' (Q797300) (← links)
- A characterization of multivalued dependencies equivalent to a join dependency (Q797316) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
