Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 10, 1993
Volume 10, Number 1, 1993
- David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink
:
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. 1-23 - Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. 24-40 - Kikuo Fujimura, Hanan Samet:
Planning a Time-Minimal Motion Among Moving Obstacles. 41-63 - Dan Gusfield, Dalit Naor:
Extracting Maximal Information About Sets of Minimum Cuts. 64-89
Volume 10, Numbers 2-4, 1993
- Bruce Randall Donald:
Special Issue on Computational Robotics: The Geometric Theory of Manipulation, Planning, and Control. 91-101 - John F. Canny, Ming C. Lin:
An Opportunistic Global Path Planner. 102-120 - Jérôme Barraquand, Jean-Claude Latombe:
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles. 121-155 - John H. Reif, Stephen R. Tate:
Continuous Alternation: The Complexity of Pursuit in Continuous Domains. 156-181 - Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap:
Shortest Paths for Line Segments. 182-200 - Kenneth Y. Goldberg:
Orienting Polygonal Parts Without Sensors. 210-225 - Michael A. Erdmann, Matthew T. Mason, George Vanecek Jr.:
Mechanical Parts Orienting: The Case of a Polyhedron on a Table. 226-247 - Michael A. Erdmann:
Randomization for Robot Tasks: Using Dynamic Programming in the Space of Knowledge States. 248-291 - David Baraff:
Issues in Computing Contact Forces for Non-Penetrating Rigid Bodies. 292-352
Volume 10, Number 5, 1993
- Esko Ukkonen, Derick Wood:
Approximate String Matching with Suffix Automata. 353-364 - Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky:
A Long-Step Barrier Method for Convex Quadratic Programming. 365-382 - Yossi Malka, Shlomo Moran, Shmuel Zaks:
A Lower Bound on the Period Length of a Distributed Scheduler. 383-398 - Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems. 399-427
Volume 10, Number 6, 1993
- Yachyang Sun, Majid Sarrafzadeh:
Floorplanning by Graph Dualization: L-shaped Modules. 429-456 - Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski:
Numerical Stability of a Convex Hull Algorithm for Simple Polygons. 457-472 - Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson:
Analytic Variations on Quadtrees. 473-500 - S. L. Mantzaris:
On "An Improved Algorithm for Finding the Median Distributively". 501-504
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
