|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 894 occurrences of 439 keywords
|
|
|
Results
Found 825 publication records. Showing 821 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
34 | Constantine N. K. Osiakwan, Selim G. Akl |
Optimal Parallel Algorithms for b-Matchings in Trees. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
postorder numbering, parallel algorithm, tree, matching, maximum independent set, EREW PRAM, b - matching, minimum set cover |
33 | Xingzhi Wen, Uzi Vishkin |
PRAM-on-chip: first commitment to silicon. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
ease-of-programming, explicit multi-threading, on-chip parallel processor, parallel algorithms, PRAM, XMT |
33 | Yuh-Rau Wang, Shi-Jinn Horng |
An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model. |
IEEE Trans. Parallel Distributed Syst. |
2003 |
DBLP DOI BibTeX RDF |
Computer vision, parallel algorithm, image processing, Voronoi diagram, Euclidean distance transform, CRCW PRAM model |
33 | Yonatan Aumann, Michael O. Rabin |
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
clock construction, fully asynchronous parallel systems, PRAM simulation, probability, atomicity, dynamic scheduler |
33 | Donald B. Johnson 0001, Panagiotis Takis Metaxas |
Connected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
CREW processors, parallel time, edges, connected components, vertices, undirected graph, CREW PRAM |
33 | Yonatan Aumann, Michael Ben-Or |
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
dynamically faulty network, asymptotically optimal PRAM emulation, parallel random access machine, faulty hypercubes, memory modules |
33 | Allen Van Gelder |
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms. |
IEEE Trans. Computers |
1989 |
DBLP DOI BibTeX RDF |
PRAM processor allocation, sublogarithmic algorithms, CREW model, global memory, sublogarithmic merge algorithms, parallel computer, storage allocation, assignment, random-access storage |
33 | Baruch Awerbuch, Yossi Shiloach |
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM. |
IEEE Trans. Computers |
1987 |
DBLP DOI BibTeX RDF |
PRAM's shuffle- exchange network, parallel algorithms, Connectivity, spanning trees |
30 | Ming-Bo Lin, A. Yavuz Oruç |
Constant Time Inner Product and Matrix Computations on Permutation Network Processors. |
IEEE Trans. Computers |
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 |
30 | Shiva Chaudhuri |
Sensitive Functions and Approximate Problems |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
everywhere sensitivity, block sensitivity, sensitive functions, CRCW PRAM complexity, CREW PRAM complexity, CRCW PRAMs |
30 | Torben Hagerup, Rajeev Raman |
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting |
FOCS |
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 |
30 | Kieran T. Herley |
Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version) |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
small shared memories, bounded degree networks, PRAM algorithms, simulation, parallel random-access machine, PRAM |
28 | Byung-Do Yang, Jae-Eun Lee, Jang-Su Kim, Junghyun Cho, Seung-Yun Lee, Byoung-Gon Yu |
A Low Power Phase-Change Random Access Memory using a Data-Comparison Write Scheme. |
ISCAS |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai |
Translational Lemmas for Alternating TMs and PRAMs. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Yuk-Yin Wong, Kin-Hong Lee, Kwong-Sak Leung, C.-W. Ho |
A novel approach in parameter adaptation and diversity maintenance for genetic algorithms. |
Soft Comput. |
2003 |
DBLP DOI BibTeX RDF |
Diversity control, Rule-driven adaptive model, Adaptive genetic algorithm |
28 | Navin Goyal, Michael E. Saks, Srinivasan Venkatesh 0001 |
Optimal Separation of EROW and CROWPRAMs. |
CCC |
2003 |
DBLP DOI BibTeX RDF |
|
28 | David A. Bader, Sukanya Sreshta, Nina R. Weisse-Bernstein |
Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract). |
HiPC |
2002 |
DBLP DOI BibTeX RDF |
High-Performance Algorithm Engineering, Shared Memory, Parallel Graph Algorithms, Expression Evaluation, Tree Contraction |
28 | Yosi Ben-Asher, Esti Stein |
Basic Algorithms for the Asynchronous Reconfigurable Mes. |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
APRAM, Asynchronous, Reconfigurable mesh |
28 | Tzu-Chin Lin, Biing-Feng Wang |
Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. |
ICPADS |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Libor Bus, Pavel Tvrdík |
A Parallel Algorithm for Connected Components on Distributed Memory Machines. |
PVM/MPI |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Robert C. Steinke, Gary J. Nutt |
A Lattice Based Framework of Shared Memory Consistency Models. |
ICDCS |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Jerzy Brzezinski, Dariusz Wawrzyniak |
Consistency Requirements of Distributed Shared Memory for Dijkstra's Mutual Exclusion Algorithm. |
ICDCS |
2000 |
DBLP DOI BibTeX RDF |
distributed shared memory, mutual exclusion, consistency models |
28 | Danny Z. Chen, Jinhui Xu 0001 |
Two-Variable Linear Programming in Parallel. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Michael T. Goodrich, Edgar A. Ramos |
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. |
Discret. Comput. Geom. |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara |
A Parallel Algorithm for Weighted Distance Transforms. |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Chang-Wu Yu 0001, Gen-Huey Chen |
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
Bipartite-permutation graph, graph recognition, parallel algorithm and parallel random access machine, graph isomorphism |
28 | Bogdan S. Chlebus, Anna Gambin, Piotr Indyk |
Shared-Memory Simulations on a Faulty-Memory DMM. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Krzysztof Diks, Torben Hagerup |
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann |
Shared Memory Simulations with Triple-Logarithmic Delay. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Hans L. Bodlaender, Torben Hagerup |
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
Computing Shortest Paths and Distances in Planar Graphs. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Pilar de la Torre, Clyde P. Kruskal |
Towards a Single Model of Efficient Computation in Real Parallel Machines. |
PARLE (1) |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Torben Hagerup, Arno Schmitt, Helmut Seidl |
FORK: A High-Level Language for PRAMs. |
PARLE (1) |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Kwong-fai Chan, Tak Wah Lam |
Finding Least-Weight Subsequences with Fewer Processors. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Mikhail J. Atallah |
A Faster Parallel Algorithm for a Matrix Searching Problem. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Ivan Stojmenovic |
Detecting intersection of two convex polygons in parallel. |
ACM Conference on Computer Science |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Stefan D. Bruda, Yuanqiao Zhang |
The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR. |
ISPDC |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Mahmoud Hasanloo, Ali Amiri 0002, Mahmood Fathy |
A High Performance Parallel IP Lookup Technique Based on Multiprocessor Organization and CREW PRAM. |
Asia International Conference on Modelling and Simulation |
2008 |
DBLP DOI BibTeX RDF |
Parallel Processing, IP lookup, Router Architecture |
28 | Thomas M. DuBois, Bryant C. Lee, Yi Wang, Marc Olano, Uzi Vishkin |
XMT-GPU: A PRAM Architecture for Graphics Computation. |
ICPP |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Stanley C. Eisenstat |
O(log* n) algorithms on a Sum-CRCW PRAM. |
Computing |
2007 |
DBLP DOI BibTeX RDF |
parallel prefix sums, linear integer sorting, Parallel random access machine |
28 | Jerzy Brzezinski, Cezary Sobaniec, Dariusz Wawrzyniak |
Session Guarantees to Achieve PRAM Consistency of Replicated Shared Objects. |
PPAM |
2003 |
DBLP DOI BibTeX RDF |
consistency models, Replicated objects, session guarantees |
28 | Adnan Agbaria, Yosi Ben-Asher, Ilan Newman |
Communication - Processor Tradeoffs in a Limited Resources PRAM. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Saurabh Srivastava 0003, Phalguni Gupta |
Approximating the Range Sum of a Graph on CREW PRAM. |
IWDC |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer |
Fast Computation of the 3-D Euclidean Distance Transform on the EREW PRAM Model. |
ICPP |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Carla Denise Castanho, Wei Chen 0003, Koichi Wada 0001, Akihiro Fujiwara |
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Joachim von zur Gathen, Igor E. Shparlinski |
The CREW PRAM Complexity of Modular Inversion. |
LATIN |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Ville Leppänen |
Goodness of Time-Processor Optimal PRAM Simulations. |
Euro-Par, Vol. II |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Andrea Pietracaprina, Geppino Pucci |
Improved Deterministic PRAM Simulation on the Mesh. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Welf Löwe |
Optimization of PRAM-Programs with Input-Dependent Memory Access. |
Euro-Par |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Bogdan S. Chlebus, Anna Gambin, Piotr Indyk |
PRAM Computations Resilient to Memory Faults. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack |
Optimal CREW-PRAM Algorithms for Direct Dominance Problems. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Torben Hagerup |
Fast Integer Merging on the EREW PRAM. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Costas S. Iliopoulos, William F. Smyth |
PRAM Algorithms for Identifying Polygon Similarity. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
28 | Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik |
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Walter W. Kirchherr |
A Hierarchy Theorem for Pram-Based Complexity Classes. |
FSTTCS |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Chia-Wei Lee, Justie Su-tzu Juan, Tai-Lung Wu |
An On-Line Parallel Algorithm for Node Ranking of Trees. |
ICA3PP |
2009 |
DBLP DOI BibTeX RDF |
Node ranking, algorithm, parallel algorithm, tree, PRAM, on-line |
24 | Jalal A. Nasiri, M. Amir Moulavi, Sepideh Nazemi Gelyan, Hossein Deldari, Hadi Sadoghi Yazdi, A. Eshghi Shargh |
An Efficient Parallel Eye Detection Algorithm on Facial Color Images. |
SNPD |
2008 |
DBLP DOI BibTeX RDF |
Facial Color Images, Parallel Algorithm, PRAM, Eye Detection |
24 | Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger |
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
pram, thread based parallelism, dynamic programming, multi-core, divide and conquer, models of computation |
24 | Wei Chen 0003, Koichi Wada 0001 |
On Computing the Upper Envelope of Segments in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
2002 |
DBLP DOI BibTeX RDF |
upper envelope, Davenport-Schinzel sequence, Computational geometry, visibility, convex hull, EREW PRAM model |
24 | Jie Wu 0001, Stephan Olariu |
On Cost-Optimal Merge of Two Intransitive Sorted Sequences. |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
sorting, merging, PRAM, Hamiltonian path, tournament |
24 | Brigitte Vallée |
Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Node deletion, Node replacement, Minimum spanning tree, CREW PRAM |
24 | B. Das, Michael C. Loui |
Reconstructing a Minimum Spanning Tree after Deletion of Any Node. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Node deletion, Node replacement, Minimum spanning tree, CREW PRAM |
24 | Keqin Li, Victor Y. Pan |
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. |
IEEE Trans. Computers |
2001 |
DBLP DOI BibTeX RDF |
Bilinear algorithm, optical pipelined bus, distributed memory system, matrix multiplication, speedup, PRAM, reconfigurable system, linear array, cost-optimality |
24 | Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang |
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
2000 |
DBLP DOI BibTeX RDF |
Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique |
24 | Andreas Savva, Takashi Nanya |
A Gracefully Degrading Massively Parallel System Using the BSP Model, and Its Evaluation. |
IEEE Trans. Computers |
1999 |
DBLP DOI BibTeX RDF |
memory duplication, RSM, fault tolerance, PRAM, graceful degradation, MPP, BSP model |
24 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu |
Parallel Algorithms for the Tree Bisector Problem and Applications. |
ICPP |
1999 |
DBLP DOI BibTeX RDF |
Trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique |
24 | Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis |
A Parallel Priority Data Structure with Applications. |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
parallel priority data structure, algorithm running time, data structures, time complexity, iteration, parallel implementation, Dijkstra's algorithm, CREW PRAM |
24 | 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. |
IPPS |
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 |
24 | Biing-Feng Wang, Stephan Olariu |
On the Power of the Mesh with Hybrid Buses. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
Mesh with Hybrid Buses, Mesh with Multiple Broadcasting, simulation, parallel algorithms, PRAM, reconfigurable mesh |
24 | Sung Kwon Kim |
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable |
24 | Nageswara S. V. Rao |
On Parallel Algorithms for Single-Fault Diagnosis in Fault Propagation Graph Systems. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
fault propagation graph, operative diagnosis, CREW PRAM and hypercube, Fault diagnosis, single fault |
24 | Xiaotie Deng, Binhai Zhu |
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. |
IPPS |
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 |
24 | Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001 |
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. |
IPPS |
1996 |
DBLP DOI BibTeX RDF |
parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model |
24 | Bruce M. Maggs |
A Critical Look at Three of Parallel Computing's Maxims. |
ISPAN |
1996 |
DBLP DOI BibTeX RDF |
architectural convergence, parallel computer, wormhole routing, parallel random-access machine (PRAM) |
24 | Zvi Galil |
A Constant-Time Optimal Parallel String-Matching Algorithm. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
lion hunting, string matching, period, CRCW-PRAM, optimal parallel algorithm, constant time |
24 | Richard M. Karp |
Modeling parallel communication. |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
cost of computation, cost of communication, Valiant's BSP model, PRAM(m) model, FFT computation, tridiagonal systems, performance evaluation, performance, framework, broadcasting, sorting, shared memory systems, distributed-memory multiprocessor, communication latency, prefix summing, summing, LogP model, communication bandwidth |
24 | Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng |
Recognizing depth-first-search trees in parallel. |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model |
24 | Abdel Ejnioui, N. Ranganathan |
Systolic algorithms for tree pattern matching. |
ICCD |
1995 |
DBLP DOI BibTeX RDF |
pattern tree, subject tree, PRAM model of computation, linear systolic array model, parallel algorithms, parallel algorithms, pattern matching, systolic arrays, SIMD machine, systolic algorithms, tree pattern matching |
24 | Ernst W. Mayr |
Scheduling interval orders in parallel. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems |
24 | Saibal Das, Sanjeev Saxena |
Parallel algorithms for single row routing in narrow streets. |
VLSI Design |
1995 |
DBLP DOI BibTeX RDF |
narrow streets, optimal layout, parallel algorithms, parallel algorithms, VLSI, network routing, circuit layout CAD, VLSI layout, integrated circuit layout, single row routing, IC design, CREW PRAM, tree machine |
24 | Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan |
Parallel Dynamic Programming. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
parallel dynamicprogramming, optimal binary search tree, optimal triangulation ofpolygons, CREW PRAM algorithm, parallel algorithms, computational complexity, dynamic programming, time complexity, matrix multiplication |
24 | Mi Lu, Hua Lin |
Parallel Algorithms for the Longest Common Subsequence Problem. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound |
24 | David E. Culler, Richard M. Karp, David A. Patterson 0001, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken |
LogP: Towards a Realistic Model of Parallel Computation. |
PPoPP |
1993 |
DBLP DOI BibTeX RDF |
parallel algorithms, PRAM, complexity analysis, parallel models, massively parallel processors |
24 | Stephan Olariu, James L. Schwing, Jingyuan Zhang |
Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals. |
IEEE Trans. Parallel Distributed Syst. |
1992 |
DBLP DOI BibTeX RDF |
family of intervals, cost-optimal parallel algorithms, O(log n) time, scheduling, parallel algorithms, parallel algorithms, computational complexity, EREW-PRAM model, computational tools |
24 | Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu |
On the Parallel Computation of the Algebraic Path Problem. |
IEEE Trans. Parallel Distributed Syst. |
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 |
24 | Jing-Fu Jenq, Sartaj Sahni |
Serial and Parallel Algorithms for the Medial Axis Transform. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1992 |
DBLP DOI BibTeX RDF |
area reporting problem, serial algorithm, CREW PRAM algorithm, SIMD hypercube parallel algorithm, perimeter reporting problem, parallel algorithms, parallel algorithms, computational complexity, image processing, transforms, hypercube networks, medial axis transform, hypercube algorithm |
24 | Rong Lin, Stephan Olariu |
A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. |
ICCI |
1991 |
DBLP DOI BibTeX RDF |
parallel algorithms, EREW-PRAM, list ranking, lowest common ancestors, ordered trees, Euler tour |
24 | Sajal K. Das 0001, Wen-Bing Horng |
Managing a Parallel Heap Efficiently. |
PARLE (1) |
1991 |
DBLP DOI BibTeX RDF |
optimal speedup, parallel algorithm, data structure, priority queue, Algorithm analysis, heap, EREW PRAM |
24 | Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha |
Parallel Complexity in the Design and Analysis on Conurrent Systems. |
PARLE (1) |
1991 |
DBLP DOI BibTeX RDF |
partially commutative monoids, PRAM algorithms, Petri nets, CCS, boolean circuits, P-completeness |
19 | Guoping Long, Nan Yuan, Dongrui Fan |
Location Consistency Model Revisited: Problem, Solution and Prospects. |
PDCAT |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai |
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. |
Acta Informatica |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Zhaopeng Li, Kenli Li 0001, Degui Xiao, Lei Yang |
An Adaptive Parallel Hierarchical Clustering Algorithm. |
HPCC |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Inbok Lee, Costas S. Iliopoulos, Syng-Yup Ohn |
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. |
RSFDGrC |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Luigi Cinque, Sergio De Agostino |
A Parallel Decoder for Lossless Image Compression by Block Matching. |
DCC |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Jean-Michel Hélary, Alessia Milani |
About the Efficiency of Partial Replication to Implement Distributed Shared Memory. |
ICPP |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Biing-Feng Wang |
Finding r-Dominating Sets and p-Centers of Trees in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios |
An Optimal Parallel Co-Connectivity Algorithm. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Guojing Cong, David A. Bader |
Lock-Free Parallel Algorithms: An Experimental Study. |
HiPC |
2004 |
DBLP DOI BibTeX RDF |
Lock-free Data Structures, High-Performance Algorithm Engineering, Parallel Algorithms, Shared Memory |
19 | David A. Bader, Guojing Cong |
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 821 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ >>] |
|