Entity usage

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

1. Efficient algorithms for Lempel-Ziv encoding: Label: en
2. Probabilistic ancestral sequences and multiple alignments: Label: en
3. Progress in selection: Label: en
4. Safe and efficient traffic laws for mobile robots: Label: en
5. Walking streets faster: Label: en
6. Optimal orthogonal drawings of triconnected plane graphs: Label: en
7. On two dimensional packing: Label: en
8. Neighbours on a grid: Label: en
9. A fast heuristic for approximating the minimum weight triangulation: Label: en
10. Visibility with multiple reflections: Label: en
11. Linear-time heuristics for minimum weight rectangulation: Label: en
12. A linear time algorithm for the feasibility of pebble motion on trees: Label: en
13. Optimal cost-sensitive distributed minimum spanning tree algorithm: Label: en
14. Communication complexity of gossiping by packets: Label: en
15. Neighborhood graphs and distributed Δ+1-coloring: Label: en
16. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees: Label: en
17. Lower bounds for dynamic transitive closure, planar point location, and parentheses matching: Label: en
18. Sorting and searching revisted: Label: en
19. Using sparsification for parametric minimum spanning tree problems: Label: en
20. Greedily finding a dense subgraph: Label: en
21. Computing the unrooted maximum agreement subtree in sub-quadratic time: Label: en
22. On the hardness of approximating the minimum consistent OBDD problem: Label: en
23. The constrained minimum spanning tree problem: Label: en
24. Facility dispersion and remote subgraphs: Label: en
25. Service-constrained network design problems: Label: en
26. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning: Label: en
27. The randomized complexity of maintaining the minimum: Label: en
28. Boolean analysis of incomplete examples: Label: en
29. Binary search trees: How low can you go?: Label: en
30. Priority queues on parallel machines: Label: en
31. The deterministic complexity of parallel multisearch: Label: en
32. Making an arbitrary filled graph minimal by removing fill edges: Label: en
33. Vertex partitioning problems on partial k-trees: Label: en
34. Approximation algorithms for the maximum satisfiability problem: Label: en
35. On the hardness of global and local approximation: Label: en
36. Randomized approximation of the constraint satisfaction problem: Label: en
37. Approximate hypergraph coloring: Label: en