Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 24, 1999
Volume 24, Number 1, 1999
- Monika Rauch Henzinger, Valerie King, Tandy J. Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. 1-13 - Yanjun Zhang, A. Ortynski:
Efficiency of Randomized Parallel Backtrack Search. 14-28 - Stefano Leonardi, Alberto Marchetti-Spaccamela:
On-Line Resource Management with Application to Routing and Scheduling. 29-49 - Svante Carlsson, Bengt J. Nilsson:
Computing Vision Points in Polygons. 50-75 - Paul Pritchard:
A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. 76-86
Volume 24, Number 2, 1999
- Bin Fu, Richard Beigel:
A Comparison of Resource-Bounded Molecular Computation Models. 87-95 - Haim Kaplan, Ron Shamir
:
Bounded Degree Interval Sandwich Problems. 96-104 - Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. 105-127 - Ravi Kumar, Alexander Russell, Ravi Sundaram:
Approximating Latin Square Extensions. 128-138 - Frank Thomson Leighton, Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memo. 139-171
Volume 24, Numbers 3-4, 1999
- Frank K. H. A. Dehne:
Guest Editor's Introduction. 173-176 - Paolo Ferragina, Fabrizio Luccio:
String Search in Coarse-Grained Parallel Computers. 177-194 - Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. 195-208 - Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines. 209-242 - Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor:
Design and Implementation of a Practical Parallel Delaunay Algorithm. 243-269 - Xiaotie Deng, Binhai Zhu:
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. 270-286 - William F. McColl, Alexandre Tiskin:
Memory-Efficient Matrix Multiplication in the BSP Model. 287-297 - Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna:
Efficient Algorithms for Block-Cyclic Redistribution of Arrays. 298-330 - Erich L. Kaltofen, Austin Lobo:
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. 331-348 - Thomas H. Cormen, James C. Clippinger:
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. 349-370 - E. L. G. Saukas, S. W. Song:
A Note on Parallel Selection on Coarse-Grained Multicomputers. 371-380 - Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions. 381-404 - Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. 405-422
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-19 19: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:
