The following pages link to STACS 89 (Q5096138):
Displaying 44 items.
- On genuinely time bounded computations (Q5096139) (← links)
- Unified Algebras and action semantics (Q5096140) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- A first order logic for partial functions (Q5096142) (← links)
- Observational implementations (Q5096143) (← links)
- On the boundary of a union of Rays (Q5096144) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- Time-optimal simulations of networks by universal parallel computers (Q5096148) (← links)
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats (Q5096149) (← links)
- Linear numeration systems, θ-developments and finite automata (Q5096150) (← links)
- A generalization of automatic sequences (Q5096151) (← links)
- Word problems over traces which are solvable in linear time (Q5096152) (← links)
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (Q5096153) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
- Successive approximation in parallel graph algorithms (Q5096155) (← links)
- Reversals and alternation (Q5096156) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Complete problems and strong polynomial reducibilities (Q5096158) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)
- On the complexity of approximating the independent set problem (Q5096160) (← links)
- Average number of messages for distributed leader finding in rings of processors (Q5096161) (← links)
- Time vs bits (Q5096162) (← links)
- Distributed computing on transitive networks: The torus (Q5096163) (← links)
- Time is not a healer (Q5096164) (← links)
- Area efficient methods to increase the reliability of combinatorial circuits (Q5096165) (← links)
- Fault masking probabilities with single and multiple signature analysis (Q5096167) (← links)
- Chain properties of rule closures (Q5096168) (← links)
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169) (← links)
- Algebraic specifications for domain theory (Q5096170) (← links)
- The query topology in logic programming (Q5096171) (← links)
- Testing membership: Beyond permutation groups (Q5096172) (← links)
- Membership in polynomial ideals over Q is exponential space complete (Q5096173) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- Deciding bisimulation equivalences for a class of non-finite-state programs (Q5096175) (← links)
- Measure of parallelism of distributed computations (Q5096176) (← links)
- Decidability of weak fairness in petri nets (Q5096177) (← links)
- New results on the generalized star-height problem (Q5096178) (← links)
- On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- Concatenable segment trees (Q5096181) (← links)
- Shortest edge-disjoint paths in graphs (Q5096182) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
