|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 237 occurrences of 133 keywords
|
|
|
Results
Found 138 publication records. Showing 138 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
138 | Torben Hagerup |
Fast and Optimal Simulations between CRCW PRAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 45-56, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
102 | Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
Work-Time Optimal k-Merge Algorithms on the PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(3), pp. 275-282, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
work-time optimal algorithms, information retrieval, parallel algorithms, databases, query processing, sorting, Merging |
100 | Yu-Hua Lee, Shi-Jinn Horng |
Fast parallel chessboard distance transform algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 488-493, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
fast parallel chessboard distance transform algorithms, diagonal propagation approach, O(N2) time sequential algorithm, 2-D binary image array, parallel algorithms, computational complexity, image processing, computational geometry, hypercube networks, medial axis transform, EREW PRAM model, hypercube computer, CRCW PRAM model |
100 | G. Sajith, Sanjeev Saxena |
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(2), pp. 187-197, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
CRCW model, Tree colouring, Parallel algorithms, Optimal algorithms, Maximal independent set |
87 | Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih |
Parallel Algorithms for Single-Layer Channel Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 456-465, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
83 | Yuh-Rau Wang, Shi-Jinn Horng |
An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(10), pp. 973-982, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Computer vision, parallel algorithm, image processing, Voronoi diagram, Euclidean distance transform, CRCW PRAM model |
78 | Yossi Matias, Uzi Vishkin |
A note on reducing parallel model simulations to integer sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 208-212, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
parallel model simulations, FETCH&ADD PRAM model, parallel algorithms, sorting, hashing, bootstrapping, bootstrapping, EREW PRAM, CRCW PRAM, simulation algorithms, integer sorting |
69 | Stanley C. Eisenstat |
O(log* n) algorithms on a Sum-CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 79(1), pp. 93-97, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
parallel prefix sums, linear integer sorting, Parallel random access machine |
68 | Lin Chen 0001 |
Optimal overlap representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 8-14, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
optimal overlap representations, minimal interval, circular arc overlap representations, minimal interval overlap representation, EREW PRAM processors, common CRCW PRAM, BSR processors, parallel algorithms, computational complexity, computational geometry, optimal algorithms |
68 | Mikhail J. Atallah |
A Faster Parallel Algorithm for a Matrix Searching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 192-200, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
65 | Torben Hagerup, Tomasz Radzik |
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, Island of Crete, Greece, July 2-6, 1990, pp. 117-124, 1990, ACM, 0-89791-370-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
64 | Lin Chen 0001 |
Optimal Circular Arc Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '95 Parallel Processing, First International Euro-Par Conference, Stockholm, Sweden, August 29-31, 1995, Proceedings, pp. 255-266, 1995, Springer, 3-540-60247-X. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
64 | Lorrie Fava Lindon, Selim G. Akl |
An Optimal Implementation of Broadcasting with Selective Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(3), pp. 256-269, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
optimal implementation, broadcasting with selective reduction, concurrent-read concurrent-write, concurrentmemory access, BROADCAST instruction, memory locations, parallel computation, parallel random access machine, PRAM, instruction sets, random-access storage, parallelalgorithms |
64 | Peter J. Varman, Kshitij A. Doshi |
Improved parallel algorithms for the depth-first search and monotone circuit value problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 175-182, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
60 | Miroslaw Kutylowski, Krzysztof Lorys |
Limitations of the QRQW and EREW PRAM Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings, pp. 310-321, 1996, Springer, 3-540-62034-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
60 | Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
Optimal Parallel Algorithms for Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings, pp. 1-17, 1990, Springer, 3-540-53832-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
59 | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen |
An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 603-607, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM |
59 | Xiaotie Deng, Binhai Zhu |
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 192-198, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
coarse grained multiprocessors, randomized parallel algorithm, local operations, global-operations, messages per processor, global data dependency, communication phases, parallel algorithms, computational complexity, computational geometry, probability, randomized algorithm, Voronoi diagram, parallel machines, computation time, line segments, randomised algorithms, random-access storage, CRCW PRAM model |
59 | Zvi Galil |
A Constant-Time Optimal Parallel String-Matching Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(4), pp. 908-918, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
lion hunting, string matching, period, CRCW-PRAM, optimal parallel algorithm, constant time |
59 | Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu |
On the Parallel Computation of the Algebraic Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(2), pp. 251-256, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem |
55 | Chang-Wu Yu 0001, Gen-Huey Chen |
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(1), pp. 3-10, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Bipartite-permutation graph, graph recognition, parallel algorithm and parallel random access machine, graph isomorphism |
51 | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam |
Improving Parallel Computation with Fast Integer Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 452-461, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parallel algorithms, graph algorithms, minimum spanning tree, PRAM, integer sorting |
51 | Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde |
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 30-41, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
46 | Fady Ghanim, Wael R. Elwasif, David E. Bernholdt |
Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: ICPP Workshops 2021: 50th International Conference on Parallel Processing, Virtual Event / Lemont (near Chicago), IL, USA, August 9-12, 2021, pp. 37:1-37:9, 2021, ACM, 978-1-4503-8441-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
46 | Muhammad Rashid |
The CRCW-PRAM Voronoi Diagram and Proximity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDPTA ![In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 3, pp. 1163-1169, 2005, CSREA Press, 1-932415-60-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
46 | Valentin E. Brimkov |
Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Pattern Recognit. Artif. Intell. ![In: Int. J. Pattern Recognit. Artif. Intell. 15(7), pp. 1167-1182, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
46 | Biing-Feng Wang |
Simulating the CRCW PRAM on Reconfigurable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 205(1-2), pp. 231-242, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
46 | Ludek Kucera |
Computing OR on a Randomized Fixed Adversary CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 63(3), pp. 165-166, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
46 | Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk |
O(log log n)-Time Integer Geometry on the CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 14(1), pp. 52-69, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
46 | W. Melody Moh, Charles U. Martel, Teng-Sheng Moh |
Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel and Distributed Computing and Systems ![In: Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, Washington, D.C., USA, October 19-21, 1995, pp. 411-415, 1995, IASTED/ACTA Press. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
46 | Naomi Nishimura |
Restricted CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 123(2), pp. 415-426, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
46 | Mounir Hamdi |
Efficient CRCW PRAM Emulation on Practical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the 1994 International Conference on Parallel Processing, North Carolina State University, NC, USA, August 15-19, 1994. Volume I: Algorithms & Applications., pp. 147-150, 1994, CRC Press, 0-8493-2495-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
46 | Paraskevi Fragopoulou |
On the Comparative Powers of the 2D-Parbs and the CRCW-Pram Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 3, pp. 301-304, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
46 | Alberto Apostolico |
Efficient CRCW-PRAM Algorithms for Universal Substring Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 108(2), pp. 331-344, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
46 | Alexander A. Shvartsman |
Achieving Optimal CRCW PRAM Fault-Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 39(2), pp. 59-66, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
46 | Paul Beame |
Lower bounds for recognizing small cliques on CRCW PRAM's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 29(1), pp. 3-20, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
46 | Paul Beame, Johan HÃ¥stad |
Optimal bounds for decision problems on the CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 36(3), pp. 643-670, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
46 | Paul Beame, Johan HÃ¥stad |
Optimal Bounds for Decision Problems on the CRCW PRAM ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 83-93, 1987, ACM, 0-89791-221-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
45 | Jie Li 0002, Yi Pan 0001, Hong Shen 0001 |
More Efficient Topological Sort Using Reconfigurable Optical Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 24(3), pp. 251-258, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
time complexity, analysis of algorithms, massive parallelism, graph problem, optical bus |
45 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi |
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(9), pp. 888-898, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Parallel algorithms, trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique |
45 | Piotr Berman, Andrzej Lingas |
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 73-82, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
45 | José L. Balcázar, Josep DÃaz, Ricard Gavaldà , Osamu Watanabe 0001 |
An Optimal Parallel Algorithm for Learning DFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 208-217, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
45 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE ![In: PARLE '93, Parallel Architectures and Languages Europe, 5th International PARLE Conference, Munich, Germany, June 14-17, 1993, Proceedings, pp. 553-560, 1993, Springer, 3-540-56891-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
41 | Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara |
A Parallel Algorithm for Weighted Distance Transforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 407-412, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
41 | Krzysztof Diks, Torben Hagerup |
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 126-140, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
41 | Martti Forsell, Martti Penttonen, Ville Leppänen |
Efficient Two-Level Mesh based Simulation of PRAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 29-35, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
time-processor optimal, simulation, interconnection network, mesh, PRAM, shared memory machine |
41 | Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann |
Shared Memory Simulations with Triple-Logarithmic Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 46-59, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
41 | Hans L. Bodlaender, Torben Hagerup |
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 268-279, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
41 | Joseph Gil |
Fast load balancing on a PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 10-17, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
36 | Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev |
Theoretical Issues of Cluster Pattern Interfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 13th International Workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24-27, 2009. Proceedings, pp. 302-315, 2009, Springer, 978-3-642-10208-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
carpet encoding, cluster pattern interface CLUSPI, parallel algorithm, CRCW-PRAM model |
36 | Jean Frédéric Myoupo, David Semé |
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 38(1), pp. 83-107, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point |
36 | Ming-Bo Lin, A. Yavuz Oruç |
Constant Time Inner Product and Matrix Computations on Permutation Network Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(12), pp. 1429-1434, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
constant time inner product, permutation network processors, algebraic computations, cost complexities, computational complexity, parallel architectures, time complexities, matrix algebra, PRAM, parallel computation model, matrix computations, CRCW PRAM |
36 | Shiva Chaudhuri |
Sensitive Functions and Approximate Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 186-193, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
everywhere sensitivity, block sensitivity, sensitive functions, CRCW PRAM complexity, CREW PRAM complexity, CRCW PRAMs |
36 | Richard Cole 0001, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan 0001, Kunsoo Park, Wojciech Rytter |
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 248-258, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
optimally fast parallel algorithms, parallel CRCW PRAM algorithms, constant-time text search algorithm, probabilistic string-matching algorithm, pattern matching, preprocessing, time bound, Las-Vegas algorithm |
36 | Hubert Wagener |
Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 593-599, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
visibility region, subchain hull queries, data structure, convex hull, runtime, simple polygons, simple polygon, CRCW-PRAM, optimal parallel algorithm |
36 | Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Complexity of Parallel Prefix Problems on Small Domains ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 638-647, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
small domain problems, parallel prefix problems, small domains, prefix maxima, range maxima, parenthesis matching problem, very fast parallel algorithms, complexity, lower bound, chaining, CRCW PRAM model |
36 | Torben Hagerup, Rajeev Raman |
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 628-637, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
approximate prefix summation problems, loose parallel sorting, input keys, padded sorting, fast randomised CRCW PRAM algorithms, nonstandard OR PRAM, time complexity, random numbers, integer sorting |
36 | Michael T. Goodrich |
Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 711-722, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
parallel computational geometry, randomized CRCW PRAM, parallel algorithms, approximation algorithms, processor allocation |
36 | Jens Lagergren |
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 173-182, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
sequential time complexity, monadic second order properties, linear extended monadic second order extremum problems, concurrent-read, concurrent-write parallel random access machine, enumeration problems, parallel algorithms, graphs, tree-decomposition, tree width, CRCW PRAM |
36 | Noga Alon, Nimrod Megiddo |
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 574-582, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
fixed dimension, linear programming problem, probabilistic CRCW PRAM, computational complexity, probability, constant time |
36 | Charles U. Martel, Ramesh Subramonian, Arvin Park |
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 590-599, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
synchronous PRAMs, asynchronous behavior, CRCW, concurrent-read, concurrent-write, asynchronous CRCW PRAM, expected work, parallel step, parallel instructions, fail-stop error, parallel random-access-machine, synchronization primitive, simulation technique |
36 | Vijaya Ramachandran, John H. Reif |
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 282-287, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
graph planarity, open ear decomposition, embedding, graph connectivity, CRCW PRAM, optimal parallel algorithm |
36 | Samir Khuller, Baruch Schieber |
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 288-293, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM |
36 | Elias Dahlhaus, Marek Karpinski |
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 454-459, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
minimal elimination ordering, MEO, arbitrary graph, concurrent-read-concurrent-write parallel random-access machine, parallel algorithm, divide-and-conquer, CRCW PRAM |
32 | Zhaopeng Li, Kenli Li 0001, Degui Xiao, Lei Yang |
An Adaptive Parallel Hierarchical Clustering Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: High Performance Computing and Communications, Third International Conference, HPCC 2007, Houston, USA, September 26-28, 2007, Proceedings, pp. 97-107, 2007, Springer, 978-3-540-75443-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Limin Xiang, Kazuo Ushijima, Kai Cheng, Jianjun Zhao 0001, Cunwei Lu |
O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, PDCAT 2004, Singapore, December 8-10, 2004, Proceedings, pp. 218-225, 2004, Springer, 3-540-24013-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Amitava Datta |
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 23(2), pp. 193-211, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
reconfigurable pipelined bus, minimum spanning forest, parallel algorithm, graph algorithms, connected components, optical computing, biconnected components |
32 | Limin Xiang, Kazuo Ushijima |
Optimal Parallel Merging Algorithms on BSR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 5th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2000), 7-10 December 2000, Dallas / Richardson, TX, USA, pp. 12-17, 2000, IEEE Computer Society, 0-7695-0936-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Limin Xiang, Kazuo Ushijima, Selim G. Akl, Ivan Stojmenovic |
An Efficient Implementation for the BROADCAST Instruction of BSR+. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(8), pp. 852-863, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
broadcasting with selective reduction, single selection, multiple selection, general selection, Parallel computation model |
32 | Babette de Fluiter, Hans L. Bodlaender |
Parallel Algorithms for Treewidth Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 157-170, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko |
. Efficient Parallel Algorithms on Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1997 International Conference on Parallel Processing (ICPP '97), August 11-15, 1997, Bloomington, IL, USA, Proceedings, pp. 20-25, 1997, IEEE Computer Society, 0-8186-8108-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Steiner tree, PRAM, connected dominating set, clique, distance-hereditary graph |
32 | Ivan Stojmenovic |
Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(2), pp. 218-224, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
parenthesis matching, parallel algorithm, broadcast, sorting, selection, reduction, Binary tree, parallel prefix, tree traversals |
32 | Hans L. Bodlaender, Babette de Fluiter |
Parallel Algorithms for Series Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 277-289, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
32 | Svante Carlsson, Jingsen Chen, Christer Mattsson |
Heaps with Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 288-296, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Insup Lee 0001, Sanguthevar Rajasekaran |
A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 6th International Conference, CAV '94, Stanford, California, USA, June 21-23, 1994, Proceedings, pp. 404-414, 1994, Springer, 3-540-58179-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman |
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 99-114, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
32 | Artur Czumaj |
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 62-72, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
32 | Lin Chen 0001 |
Efficient Deterministic Parallel Algorithms for Integer Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 433-442, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Resource Tradeoff, Parallel Computation, Lower Bound, Sorting, PRAM, Algorithm Design and Analysis, Prefix Sum, Lexicographic Order, NC |
32 | Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter |
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 204-214, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella |
Finding Triconnected Components by Local Replacements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 379-393, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Stefan D. Bruda, Yuanqiao Zhang |
The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 1-5 July 2008, Krakow, Poland, pp. 179-185, 2008, IEEE Computer Society, 978-0-7695-3472-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Mingxian Jin, Johnnie W. Baker |
On the Power of the Multiple Associative Computing (MASC) Model Related to That of Reconfigurable Bus-Based Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA, pp. 1-8, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Ryan Williams 0001 |
Parallelizing time with polynomial circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 171-175, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
parallel speedup, circuit complexity, alternation |
23 | John G. Del Greco, Chandra N. Sekharan, R. Sridhar 0001 |
Fast Parallel Reordering and Isomorphism Testing of k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(1), pp. 61-72, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree |
23 | Sanguthevar Rajasekaran, Suneeta Ramaswami |
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(4), pp. 436-460, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Ambuj Tewari, Utkarsh Srivastava, P. Gupta |
A Parallel DFA Minimization Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2002, 9th International Conference, Bangalore, India, December 18-21, 2002, Proceedings, pp. 34-40, 2002, Springer, 3-540-00303-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | George E. Andrews, Arnold Knopfmacher |
An Algorithmic Approach to Discovering and Proving q-Series Identities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(1), pp. 34-43, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree |
23 | Weifa Liang, Richard P. Brent, Hong Shen |
Fully Dynamic Maintenance of k-Connectivity in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(8), pp. 846-864, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms |
23 | Sidi Mohamed Sedjelmaci |
On a Parallel Extended Euclidean Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2001 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2001), 26-29 June 2001, Beirut, Lebanon, pp. 235-241, 2001, IEEE Computer Society, 0-7695-1165-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Neelima Gupta, Sumit Chopra, Sandeep Sen |
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings, pp. 183-194, 2001, Springer, 3-540-43002-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Sidi Mohamed Sedjelmaci |
On a parallel Lehmer-Euclid GCD algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 303-308, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Shay Kutten, David Peleg |
Deterministic distributed resource discovery (brief announcement). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 336, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Eric Allender, Meena Mahajan |
The Complexity of Planarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 87-98, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi |
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN'99, 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999, Proceedings, pp. 27-36, 1999, Springer, 3-540-66856-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Hiroshi Nagamochi, Toru Hasunuma |
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 447-456, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Ka Wong Chong, Edgar A. Ramos |
Improved Deterministic Parallel Padded Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 405-416, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Jens Gustedt |
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 421-431, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
parallel algorithms, graph algorithms, minimum spanning tree, graph minors |
23 | Keqin Li |
Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 11(4), pp. 391-403, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication |
23 | Biing-Feng Wang, Stephan Olariu |
On the Power of the Mesh with Hybrid Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 172-178, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Mesh with Hybrid Buses, Mesh with Multiple Broadcasting, simulation, parallel algorithms, PRAM, reconfigurable mesh |
23 | Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki |
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 105-111, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree |
Displaying result #1 - #100 of 138 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|