Journal Article (3187)
3121.
Journal Article
19 (5), pp. 902 - 906 (1990)
On the Complexity of a Game Related to the Dictionary Problem. SIAM Journal on Computing 3122.
Journal Article
35 (3), pp. 137 - 143 (1990)
Hidden Line Elimination for Isooriented Rectangles. Information Processing Letters 3123.
Journal Article
9, pp. 389 - 397 (1990)
Compaction on the Torus. IEEE Transactions on CAD of Integrated Circuits and Systems 3124.
Journal Article
7 (1-4), pp. 57 - 67 (1990)
Symmetric Triangular Algorithms for Curves. Computer Aided Geometric Design 3125.
Journal Article
32 (4), pp. 266 - 275 (1990)
Quaternionen in Computergraphik und Robotik / Quaternions in Computer Graphics and Robotics. Information technology 3126.
Journal Article
38 (9), pp. 1333 - 1336 (1989)
AT^2-Optimal Galois Field Multiplier for VLSI. IEEE Transactions on Computers 3127.
Journal Article
18 (2), pp. 288 - 300 (1989)
Optimal Parallel 5-Colouring of Planar Graphs. SIAM Journal on Computing 3128.
Journal Article
33 (4), pp. 181 - 185 (1989)
Optimal merging and sorting on the EREW PRAM. Information Processing Letters 3129.
Journal Article
6 (1), pp. 23 - 32 (1989)
A New Multiaffine Approach to B-splines. Computer Aided Geometric Design 3130.
Journal Article
3, pp. 237 - 256 (1988)
Congruence, Similarity, and Symmetries of Geometric Objects. Discrete and Computational Geometry 3131.
Journal Article
27 (5), pp. 227 - 236 (1988)
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Information Processing Letters 3132.
Journal Article
27 (3), pp. 125 - 128 (1988)
A Faster Approximation Algorithm for the Steiner Problem in Graphs. Information Processing Letters 3133.
Journal Article
17 (6), pp. 1093 - 1102 (1988)
A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing 3134.
Journal Article
5 (1), pp. 81 - 86 (1988)
Knot Insertion from a Blossoming Point of View. Computer Aided Geometric Design 3135.
Journal Article
16 (5), pp. 808 - 835 (1987)
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM Journal on Computing 3136.
Journal Article
25 (4), pp. 269 - 273 (1987)
A log log n Data Structure for Three-sided Range Queries. Information Processing Letters 3137.
Journal Article
75 (1), pp. 39 - 51 (1987)
Towards Optimal Parallel Bucket Sorting. Information and Computation 3138.
Journal Article
72 (3), pp. 270 - 282 (1987)
Area-Time Optimal Division for T=Omega((log n)^1+epsilon). Information and Computation 3139.
Journal Article
23 (2), pp. 163 - 176 (1986)
Algorithms for Routing in Planar Graphs. Acta Informatica 3140.
Journal Article
68 (1-3), pp. 170 - 184 (1986)
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees. Information and Control