Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
83 | Timothy J. Rolfe |
List processing: sort again, naturally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 37(2), pp. 46-48, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
mergesort, naturalmerge, sorting |
80 | Rakesh D. Barve, Jeffrey Scott Vitter |
A Simple and Efficient Parallel Disk Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(2), pp. 189-215, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
62 | Salvador Roura |
Improving Mergesort for Linked Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 267-276, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
62 | Jyrki Katajainen, Jesper Larsson Träff |
A Meticulous Analysis of Mergesort Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 217-228, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
53 | Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa |
Register Efficient Mergesorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2000, 7th International Conference, Bangalore, India, December 17-20, 2000, Proceedings, pp. 96-103, 2000, Springer, 3-540-41429-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
47 | Michael T. Goodrich, S. Rao Kosaraju |
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(2), pp. 331-361, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
cascade merging, linking automaton, mergesort, pointer machine, parallel algorithms, PRAM, expression evaluation |
44 | Ezequiel Herruzo, Guillermo Ruíz, José Ignacio Benavides, Oscar G. Plata |
A New Parallel Sorting Algorithm based on Odd-Even Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy, pp. 18-22, 2007, IEEE Computer Society, 0-7695-2784-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Hsien-Kuei Hwang |
Asymptotic Expansions of the Mergesort Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(11), pp. 911-919, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Alistair Moffat, Ola Petersson, Nicholas C. Wormald |
A Tree-Based Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(9), pp. 775-793, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Haihe Shi, Dawei Du, Jinyun Xue |
Generating Algorithms plus Loop Invariants by Formal Derivation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 7th IEEE/ACIS International Conference on Computer and Information Science, IEEE/ACIS ICIS 2008, 14-16 May 2008, Portland, Oregon, USA, pp. 496-501, 2008, IEEE Computer Society, 978-0-7695-3131-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Sanguthevar Rajasekaran |
A Framework for Simple Sorting Algorithms on Parallel Disk Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 34(2), pp. 101-114, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Tadao Takaoka |
Partial Solution and Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 700-711, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees |
29 | Yannis Manolopoulos |
On the number of recursive calls of recursive functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 37(2), pp. 61-64, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
binomial coefficient, mergesort, number of calls, recursion, fibonacci numbers |
26 | Cyril Cohen, Kazuhiko Sakaguchi |
A bargain for mergesorts (functional pearl) - How to prove your mergesort correct and stable, almost for free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.08173, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Yu-Biao Chen, Jianzhong Li 0001, Hong Gao 0001 |
Finding the optimal execution scheme of external mergesort on solid state drives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Wide Web ![In: World Wide Web 24(3), pp. 781-804, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Arif Arman, Dmitri Loguinov |
Origami: A High-Performance Mergesort Framework. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 15(2), pp. 259-271, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Pedro Holanda, Stefan Manegold |
Progressive Mergesort: Merging Batches of Appends into Progressive Indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Proceedings of the 24th International Conference on Extending Database Technology, EDBT 2021, Nicosia, Cyprus, March 23 - 26, 2021., pp. 481-486, 2021, OpenProceedings.org, 978-3-89318-084-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Albert Tedja |
Sorting Lists with Equal Keys Using Mergesort in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.08589, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
26 | Naif Aljabri, Muhammad Abdulhamid Al-Hashimi, Mostafa Elsayed Saleh, Osama Ahmed Abulnaja |
Investigating power efficiency of mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 75(10), pp. 6277-6302, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Osama Ahmed Abulnaja, Muhammad Jawad Ikram, Muhammad Abdulhamid Al-Hashimi, Mostafa Elsayed Saleh |
Analyzing Power and Energy Efficiency of Bitonic Mergesort Based on Performance Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 6, pp. 42757-42774, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Arne Maus |
A faster all parallel Mergesort algorithm for multicore processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIK ![In: 31st Norsk Informatikkonferanse, NIK 2018, Universitetet i Oslo, Oslo, Norway, September 18-20, 2018, 2018, Bibsys Open Journal Systems, Norway. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | Muhammad Abdulhamid Al-Hashimi, Osama Ahmed Abulnaja, Mostafa Elsayed Saleh, Muhammad Jawad Ikram |
Evaluating Power and Energy Efficiency of Bitonic Mergesort on Graphics Processing Unit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 5, pp. 16429-16440, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Marek A. Suchenek |
Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.08443, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
26 | Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert |
An Efficient Multiway Mergesort for GPU Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.07961, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
26 | Yomna Ben Jmaa, Karim M. A. Ali, David Duvivier, Maher Ben Jemaa, Rabie Ben Atitallah |
An Efficient Hardware Implementation of TimSort and MergeSort Algorithms Using High Level Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCS ![In: 2017 International Conference on High Performance Computing & Simulation, HPCS 2017, Genoa, Italy, July 17-21, 2017, pp. 580-587, 2017, IEEE, 978-1-5386-3249-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Joonhee Lee, Hongchan Roh, Sanghyun Park 0003 |
External Mergesort for Flash-Based Solid State Drives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 65(5), pp. 1518-1527, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Marek A. Suchenek |
Best-case Analysis of MergeSort with an Application to the Sum of Digits Problem, A manuscript (MS). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.04604, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
26 | K. Rustan M. Leino, Paqui Lucio |
An Assertional Proof of the Stability and Correctness of Natural Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 17(1), pp. 6, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Christian Sternagel |
Proof Pearl - A Mechanized Proof of GHC's Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 51(4), pp. 357-370, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Amr Elmasry, Jyrki Katajainen, Max Stenmark |
Branch Mispredictions Don't Affect Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, pp. 160-171, 2012, Springer, 978-3-642-30849-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Christian Sternagel |
Efficient Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2011, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
26 | Rikard Hultén, Christoph W. Kessler, Jörg Keller 0001 |
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par (2) ![In: Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part II, pp. 187-198, 2010, Springer, 978-3-642-15290-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan 0005, Muralidaran Vijayaraghavan |
High-throughput Pipelined Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMOCODE ![In: 6th ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2008), June 5-7, 2008, Anaheim, CA, USA, pp. 155-158, 2008, IEEE Computer Society, 978-1-4244-2417-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Zhivko Prodanov Nedev, Tao Gong, Bryan Hill |
Optimization problems in the implementation of distributed mergesort on networked computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel and Distributed Computing and Networks ![In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004, pp. 404-409, 2004, IASTED/ACTA Press. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
26 | Gianni Franceschini |
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 291-299, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
26 | Wei-Mei Chen, Hsien-Kuei Hwang, Gen-Huey Chen |
The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 30(2), pp. 423-448, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Rakesh D. Barve, Jeffrey Scott Vitter |
A Simple and Efficient Parallel Disk Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999, pp. 232-241, 1999, ACM, 1-58113-124-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Ian Parberry |
Everything you wanted to know about the running time of Mergesort but were afraid to ask. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 29(2), pp. 50-57, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Weiye Zhang, Per-Åke Larson |
Buffering and Read-Ahead Strategies for External Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB ![In: VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pp. 523-533, 1998, Morgan Kaufmann, 1-55860-566-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
26 | Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter |
Simple Randomized Mergesort on Parallel Disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Comput. ![In: Parallel Comput. 23(4-5), pp. 601-631, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter |
Simple randomized Mergesort on parallel disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Randomization Methods in Algorithm Design ![In: Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997, pp. 1-20, 1997, DIMACS/AMS, 978-0-8218-0916-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik |
Unfolding the Mystery of Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Programming Synthesis and Transformation, 7th International Workshop, LOPSTR'97, Leuven, Belgium, July 10-12, 1997, Proceedings, pp. 206-225, 1997, Springer, 3-540-65074-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Weiye Zhang, Per-Åke Larson |
Dynamic Memory Adjustment for External Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB ![In: VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece, pp. 376-385, 1997, Morgan Kaufmann, 1-55860-470-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
26 | LuoQuan Zheng, Per-Åke Larson |
Speeding up External Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 8(2), pp. 322-332, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola |
Practical In-Place Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nord. J. Comput. ![In: Nord. J. Comput. 3(1), pp. 27-40, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
26 | Hsien-Kuei Hwang |
Limit theorems for mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 8(4), pp. 319-336, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter |
Simple Randomized Mergesort on Parallel Disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996, pp. 109-118, 1996, ACM, 0-89791-809-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Wolfgang Panny, Helmut Prodinger |
Bottom-Up Mergesort - a Detailed Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 14(4), pp. 340-354, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Philippe Flajolet, Mordecai J. Golin |
Mellin Transforms and Asymptotics: The Mergesort Recurrence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 31(7), pp. 673-696, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | S. Mansoor Sarwar, Mansour H. A. Jaragh, Mike Wind |
An Empirical Study of the Run-Time Behavior of Quicksort, Shellsort and Mergesort for Medium to Large Size Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Lang. ![In: Comput. Lang. 20(2), pp. 127-134, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Mordecai J. Golin, Robert Sedgewick |
Queue-Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 48(5), pp. 253-259, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Svante Carlsson, Christos Levcopoulos, Ola Petersson |
Sublinear Merging and Natural Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 9(6), pp. 629-648, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Vinay S. Pai, Peter J. Varman |
Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the Eighth International Conference on Data Engineering, February 3-7, 1992, Tempe, Arizona, USA, pp. 273-282, 1992, IEEE Computer Society, 0-8186-2545-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | Vinay S. Pai, Alejandro A. Schäffer, Peter J. Varman |
Markov Analysis of Multiple-Disk Prefetching for External Mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the 1992 International Conference on Parallel Processing, University of Michigan, An Arbor, Michigan, USA, August 17-21, 1992. Volume III: Algorithms & Applications., pp. 272-279, 1992, CRC Press, 0-8493-0783-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
26 | Susan R. Wallace |
Exploiting non-inherent parallelism in an internal mergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 28th Annual Southeast Regional Conference, 1990, Greenville, South Carolina, USA, April 18-20, 1990, pp. 159-164, 1990, ACM, 0-89791-356-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
26 | A. Inkeri Verkamo |
Performance comparison of distributive and mergesort as external sorting algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Softw. ![In: J. Syst. Softw. 10(3), pp. 187-200, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
26 | Sai Choi Kwan, Jean-Loup Baer |
The I/O Performance of Multiway Mergesort and Tag Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 34(4), pp. 383-387, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano |
The Price of Resiliency: a Case Study on Sorting with Memory Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(4), pp. 597-620, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Memory faults, Computing with unreliable information, Sorting, Fault injection, Memory models, Experimental algorithmics |
18 | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin |
Sorting and selection in posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 392-401, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Tuerk |
A Formalisation of Smallfoot in HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings, pp. 469-484, 2009, Springer, 978-3-642-03358-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Panayiotis Andreou, Orestis Spanos, Demetrios Zeinalipour-Yazti, George Samaras, Panos K. Chrysanthis |
FSort: external sorting on flash-based sensor devices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMSN ![In: Proceedings of the 6th Workshop on Data Management for Sensor Networks, in conjunction with VLDB, DMSN 2009, Lyon, France, August 24, 2009, 2009, ACM, 978-1-60558-777-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the adaptiveness of Quicksort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 3.2:1-3.2:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Quicksort, branch mispredictions |
18 | Paul Biggar, Nicholas Nash, Kevin Williams 0001, David Gregg |
An experimental study of sorting and branch prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.8:1-1.8:39, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
caching, Sorting, branch prediction, pipeline architectures |
18 | Jörg Keller 0001, Christoph W. Kessler |
Optimized Pipelined Parallel Merge Sort on the Cell BE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par Workshops ![In: Euro-Par 2008 Workshops - Parallel Processing, VHPC 2008, UNICORE 2008, HPPC 2008, SGS 2008, PROPER 2008, ROIA 2008, and DPA 2008, Las Palmas de Gran Canaria, Spain, August 25-26, 2008, Revised Selected Papers, pp. 131-140, 2008, Springer, 978-3-642-00954-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Lars Arge, Michael T. Goodrich, Michael J. Nelson 0002, Nodari Sitchinava |
Fundamental parallel algorithms for private-cache chip multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008, pp. 197-206, 2008, ACM, 978-1-59593-973-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
parallel external memory, pem, private-cache cmp |
18 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a cache-oblivious sorting algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 2.2:1-2.2:23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
funnelsort, quicksort, Cache-oblivious algorithms |
18 | Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano |
The Price of Resiliency: A Case Study on Sorting with Memory Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 768-779, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Manuel Barbosa, Alcino Cunha, Jorge Sousa Pinto |
Recursion patterns and time-analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 40(5), pp. 45-54, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Gerth Stølting Brodal, Gabriel Moruz |
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 385-395, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Per-Åke Larson |
External Sorting: Run Formation Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(4), pp. 961-972, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
replacement selection, run formation, External sorting, merge sort |
18 | Amr Elmasry |
Three Sorting Algorithms Using Priority Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 209-220, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Christophe Cérin, Hazem Fkaier, Mohamed Jemni |
Accessing Hardware Performance Counters in order to Measure the Influence of Cache on the Performance of Integer Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 274, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Egon Börger, Tommaso Bolognesi |
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Abstract State Machines ![In: Abstract State Machines, Advances in Theory and Practice, 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003, Proceedings, pp. 218-228, 2003, Springer, 3-540-00624-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Gerth Stølting Brodal, Rolf Fagerberg |
On the limits of cache-obliviousness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 307-315, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Cache-oblivious model, tall cache assumption, lower bound, sorting, permuting |
18 | Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir |
Towards a theory of cache-efficient algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(6), pp. 828-858, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
I/O complexity, lower bound, Hierarchical memory |
18 | Manish Gupta, Sayak Mukhopadhyay, Navin Sinha |
Automatic Parallelization of Recursive Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, Newport Beach, California, USA, October 12-16, 1999, pp. 139-148, 1999, IEEE Computer Society, 0-7695-0425-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
parallelizing compilers, automatic parallelization, divide and conquer, interprocedural analysis, symbolic analysis, recursive procedures |
18 | Rakesh D. Barve, Jeffrey Scott Vitter |
A Theoretical Framework for Memory-Adaptive Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 273-284, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Axel Dold |
Software Development in PVS Using Generic Development Steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Generic Programming ![In: Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers, pp. 146-161, 1998, Springer, 3-540-41090-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
generic development steps, transformational software development, formal verification, mechanized theorem proving |
18 | Per-Åke Larson, Goetz Graefe |
Memory Management During Run Generation in External Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA., pp. 472-483, 1998, ACM Press, 0-89791-995-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
last-run optimization, replacement selection, run formation, variable length records, sorting, memory management, merge sort |
18 | Philippe Flajolet, Mordecai J. Golin |
Exact Asymptotics of Divide-and-Conquer Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 137-149, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|