Entity usage

Showing below up to 44 results in range #1 to #44.

1. Rounds versus time for the two person pebble game: Label: en
2. Shortest edge-disjoint paths in graphs: Label: en
3. Concatenable segment trees: Label: en
4. Deciding equivalence of finite tree automata: Label: en
5. On the equivalence problem for deterministic multitape automata and transducers: Label: en
6. New results on the generalized star-height problem: Label: en
7. Decidability of weak fairness in petri nets: Label: en
8. Measure of parallelism of distributed computations: Label: en
9. Deciding bisimulation equivalences for a class of non-finite-state programs: Label: en
10. Some complexity theoretic aspects of AC rewriting: Label: en
11. Membership in polynomial ideals over Q is exponential space complete: Label: en
12. Testing membership: Beyond permutation groups: Label: en
13. The query topology in logic programming: Label: en
14. Algebraic specifications for domain theory: Label: en
15. It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair: Label: en
16. Chain properties of rule closures: Label: en
17. Fault masking probabilities with single and multiple signature analysis: Label: en
18. Area efficient methods to increase the reliability of combinatorial circuits: Label: en
19. Time is not a healer: Label: en
20. Distributed computing on transitive networks: The torus: Label: en
21. Time vs bits: Label: en
22. Average number of messages for distributed leader finding in rings of processors: Label: en
23. On the complexity of approximating the independent set problem: Label: en
24. If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n: Label: en
25. Complete problems and strong polynomial reducibilities: Label: en
26. On the power of parity polynomial time: Label: en
27. Reversals and alternation: Label: en
28. Successive approximation in parallel graph algorithms: Label: en
29. Parallel computation of discrete Voronoi diagrams: Label: en
30. Computing minimum spanning forests on 1- and 2-dimensional processor arrays: Label: en
31. Word problems over traces which are solvable in linear time: Label: en
32. A generalization of automatic sequences: Label: en
33. Linear numeration systems, θ-developments and finite automata: Label: en
34. Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats: Label: en
35. Time-optimal simulations of networks by universal parallel computers: Label: en
36. Polynomial graph-colorings: Label: en
37. An O(n log n) algorithm for computing a link center in a simple polygon: Label: en
38. Dynamic planar point location with optimal query time: Label: en
39. On the boundary of a union of Rays: Label: en
40. Observational implementations: Label: en
41. A first order logic for partial functions: Label: en
42. Properties of infinite words : Recent results: Label: en
43. Unified Algebras and action semantics: Label: en
44. On genuinely time bounded computations: Label: en