Primitives for the manipulation of three-dimensional subdivisions David P. DobkinMichael J. Laszlo OriginalPaper Pages: 3 - 32
Discrete simulation of NC machining Robert L. (Scot) Drysdale IIIRobert B. JerardKen Hauck OriginalPaper Pages: 33 - 60
A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency Masato EdahiroKatsuhiko TanakaTakao Asano OriginalPaper Pages: 61 - 76
A linear-time algorithm for linearL 1 approximation of points Hiroshi ImaiKenji KatoPeter Yamamoto OriginalPaper Pages: 77 - 96
On the geodesic voronoi diagram of point sites in a simple polygon Boris Aronov OriginalPaper Pages: 109 - 140
An optimal visibility graph algorithm for triangulated simple polygons John Hershberger OriginalPaper Pages: 141 - 155
Generation of configuration space obstacles: The case of moving algebraic curves Chanderjit L. BajajMyung -Soo Kim OriginalPaper Pages: 157 - 172
On the efficiency of maximum-flow algorithms on networks with small integer capacities David Fernández-BacaCharles U. Martel OriginalPaper Pages: 173 - 189
A new algorithm for scheduling periodic, real-time tasks Joseph Y. -T. Leung OriginalPaper Pages: 209 - 219
An efficient algorithm for maxdominance, with applications Mikhail J. AtallahS. Rao Kosaraju OriginalPaper Pages: 221 - 236
On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving Shang -Ching ChouJin -Gen Yang OriginalPaper Pages: 237 - 262
A full sensing window Random-Access algorithm for messages with strict delay constraints M. PaterakisL. GeorgiadisP. Papantoni-Kazakos OriginalPaper Pages: 313 - 328
A correction algorithm for token-passing sequences in mobile communication networks Yaron I. GoldShlomo Moran OriginalPaper Pages: 329 - 341
Maximal selection in tandem networks with symmetric hearing range Jeffrey M. JaffeZvi Rosberg OriginalPaper Pages: 343 - 364
Scheduling multihop CDMA networks in the presence of secondary conflicts M. J. PostA. S. KershenbaumP. E. Sarachik OriginalPaper Pages: 365 - 393
Optimizing responses to broadcast messages in radio networks Jonathan L. WangJohn A. Silvester OriginalPaper Pages: 395 - 416
Distributed deadlock resolution in store-and-forward networks Jeffrey M. JaffeMoshe Sidi OriginalPaper Pages: 417 - 436
Efficient elections in chordal ring networks Hagit AttiyaJan van LeeuwenShmuel Zaks OriginalPaper Pages: 437 - 446
Lower bounds for maximal and convex layers problems Sanjiv KapoorPrakash Ramanan OriginalPaper Pages: 447 - 459
An algorithm for geometric minimum spanning trees requiring nearly linear expected time Kenneth L. Clarkson OriginalPaper Pages: 461 - 469
Algorithms for multicommodity flows in planar graphs Hitoshi SuzukiTakao NishizekiNobuji Saito OriginalPaper Pages: 471 - 501
Average-case analysis of the Modified Harmonic algorithm Prakash RamananKazuhiro Tsuga OriginalPaper Pages: 519 - 533
A bidirectional shortest-path algorithm with good average-case behavior Michael LubyPrabhakar Ragde OriginalPaper Pages: 551 - 567
Approximate minimum weight matching on points ink-dimensional space Pravin M. Vaidya OriginalPaper Pages: 569 - 583
A preliminary study of a diagonal channel-routing model E. LodiF. LuccioL. Pagli OriginalPaper Pages: 585 - 597
