|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 34 occurrences of 27 keywords
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
83 | Emanuele Viola, Avi Wigderson |
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 427-437, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
73 | Yosi Ben-Asher, Gadi Haber |
Parallel Solutions of Simple Indexed Recurrence Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(1), pp. 22-37, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Ordinary recurrence equations, indexed recurrence equations, pointer jumping, parallel prefix sums, Livermore Loops benchmark, parallelizing compilers, list ranking, tree contraction, Euler tour |
65 | Amit Chakrabarti |
Lower Bounds for Multi-Player Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 33-45, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
65 | André Gronemeier |
NOF-Multiparty Information Complexity Bounds for Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 459-470, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
65 | Carsten Damm, Stasys Jukna, Jirí Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 643-654, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
55 | Jop F. Sibeyn |
One-by-One Cleaning for Practical Parallel List Ranking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 345-363, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Algorithms, Parallel computing, Implementation, List ranking |
55 | Amir M. Ben-Amram, Zvi Galil |
A Generalization of a Lower Bound Technique due to Fredman and Saks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(1), pp. 34-66, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Algorithms, Parallel computing, Implementation, List ranking |
55 | Vasanth Krishna Namasivayam, Viktor K. Prasanna |
Scalable Parallel Implementation of Exact Inference in Bayesian Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, July 12-15, 2006, pp. 143-150, 2006, IEEE Computer Society, 0-7695-2612-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Pointer-Jumping, Scalability, Bayesian Networks, Partitioning, Loop level parallelization, Junction Tree |
55 | James J. Little, Guy E. Blelloch, Todd A. Cass |
Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(3), pp. 244-257, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
grid permutation, pointer jumping, fine-grained parallel machine, primitive operations, vector machine model, Gaussian convolution, computer vision, computer vision, parallel algorithm, parallel algorithms, parallel architectures, parallel architectures, edge detection, computerised picture processing, parallel machines, stereo, image structures |
37 | Jesper Larsson Träff |
Portable Randomized List Ranking on Multiprocessors Using MPI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 5th European PVM/MPI Users' Group Meeting, Liverpool, UK, September 7-9, 1998, Proceedings, pp. 395-402, 1998, Springer, 3-540-65041-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Yosi Ben-Asher, Gadi Haber |
Parallel Solutions of Simple Index Recurrence Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference, Southampton, UK, September 1-4, 1998, Proceedings, pp. 933-939, 1998, Springer, 3-540-64952-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Joshua Brody, Mario Sánchez |
Dependent Random Graphs and Multiparty Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Joshua Brody, Mario Sánchez |
Dependent Random Graphs and Multiparty Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1506.01083, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Joshua Brody, Mario Sánchez |
Dependent Random Graphs and Multi-Party Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 606-624, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
28 | Hongyu Liang |
Optimal Collapsing Protocol for Multiparty Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 54(1), pp. 13-23, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Michal Jastrzebski |
On total communication complexity of collapsing protocols for pointer jumping problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1405.7596, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
28 | Emanuele Viola, Avi Wigderson |
One-way multiparty communication lower bound for pointer jumping with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 29(6), pp. 719-743, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Joshua Brody |
The Maximum Communication Complexity of Multi-party Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
28 | Joshua Brody |
The Maximum Communication Complexity of Multi-Party Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, pp. 379-386, 2009, IEEE Computer Society, 978-0-7695-3717-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Joshua Brody, Amit Chakrabarti |
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.2843, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
28 | Joshua Brody, Amit Chakrabarti |
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 145-156, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Emanuele Viola, Avi Wigderson |
One-way multi-party communication lower bound for pointer jumping with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
28 | Amit Chakrabarti |
Lower Bounds for Multi-Player Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
28 | Carsten Damm, Stasys Jukna, Jirí Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 7(2), pp. 109-127, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Noam Nisan, Ziv Bar-Yossef |
Pointer Jumping Requires Concurrent Read ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR97, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
28 | Noam Nisan, Ziv Bar-Yossef |
Pointer Jumping Requires Concurrent Read. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 549-558, 1997, ACM, 0-89791-888-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Carsten Damm, Stasys Jukna, Jirí Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping ![Search on Bibsonomy](Pics/bibsonomy.png) |
Universität Trier, Mathematik/Informatik, Forschungsbericht ![In: Universität Trier, Mathematik/Informatik, Forschungsbericht 95-17, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
RDF |
|
28 | Carsten Damm, Stasys Jukna |
On Multiparity Games for Pointer Jumping ![Search on Bibsonomy](Pics/bibsonomy.png) |
Universität Trier, Mathematik/Informatik, Forschungsbericht ![In: Universität Trier, Mathematik/Informatik, Forschungsbericht 95-09, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
RDF |
|
28 | Carsten Damm, Stasys Jukna, Jirí Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR95, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
18 | M. Suhail Rehman, Kishore Kothapalli, P. J. Narayanan |
Fast and scalable list ranking on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 23rd international conference on Supercomputing, 2009, Yorktown Heights, NY, USA, June 8-12, 2009, pp. 235-243, 2009, ACM, 978-1-60558-498-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
irregular algorithm, parallel algorithm, gpgpu, many-core, list ranking |
18 | Sudipto Guha, Andrew McGregor 0001 |
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 760-772, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Amit Chakrabarti, Graham Cormode, Andrew McGregor 0001 |
Robust lower bounds for communication and stream computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 641-650, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
lower bounds, data streams, communication complexity |
18 | David A. Bader, Varun Kanade, Kamesh Madduri |
SWARM: A Parallel Programming Framework for Multicore Processors. ![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 |
|
18 | Susumu Nishimura |
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, pp. 293-307, 2006, Springer, 3-540-35633-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | László Babai, Thomas P. Hayes, Peter G. Kimmel |
The Cost of the Missing Bit: Communication Complexity with Help. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(4), pp. 455-488, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15 |
18 | Sun Chung, Anne Condon |
Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. ![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. 302-308, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|