Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 17, 1997
Volume 17, Number 1, January 1997
- Theodore H. Romer, Louis E. Rosier:
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling. 1-10 - Brandon Dixon, Robert Endre Tarjan:
Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. 11-18 - Frank K. H. A. Dehne, Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. 19-32 - Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded-Degree Spanner with Low Weight. 33-54 - Torben Hagerup, Miroslaw Kutylowski:
Fast Integer Merging on the EREW PRAM. 55-66 - Jørgen Bang-Jensen
, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka:
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. 67-87
Volume 17, Number 2, February 1997
- Ronald I. Greenberg, Jau-Der Shih:
Minimizing Channel Density with Movable Terminals. 89-99 - Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir:
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. 100-110 - Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec:
Evaluating Signs of Determinants Using Single-Precision Arithmetic. 111-132 - Jay N. Bhuyan, Jitender S. Deogun, Vijay V. Raghavan:
Algorithms for the Boundary Selection Problem. 133-161 - Laurent Alonso, Jean-Luc Rémy, René Schott:
A Linear-Time Algorithm for the Generation of Trees. 162-183 - Kurt Mehlhorn, R. Sundar, Christian Uhrig:
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. 183-198 - Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. 199-208
Volume 17, Number 3, March 1997
- Noga Alon, Raphael Yuster, Uri Zwick:
Finding and Counting Given Length Cycles. 209-223 - Michael Kaufmann, Jop F. Sibeyn:
Randomized Multipacket Routing and Sorting on Meshes. 224-244 - Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. 245-265 - Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, II. 266-280 - Sumanta Guha, Ichiro Suzuki:
Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles. 281-307 - Rida A. Bazzi, Gil Neiger:
The Complexity of Almost-Optimal Simultaneous Coordination. 308-321 - Rephael Wenger:
Randomized Quickhull. 322-329
Volume 17, Number 4, April 1997
- Piotr Berman, Bhaskar DasGupta:
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. 331-356 - Elon Rimon:
Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For? 357-379 - Marco Pellegrini:
On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching. 380-398 - Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. 399-415 - Sergio De Agostino, Rossella Petreschi, Andrea Sterbini:
An O(n³) Recognition Algorithm for Bithreshold Graphs. 416-425 - Susanne E. Hambrusch, Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. 426-448 - Noga Alon, Aravind Srinivasan:
Improved Parallel Approximation of a Class of Integer Programming Problems. 449-462
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 21:14 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:
