Search results for "mergesort"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
83	Timothy J. Rolfe	List processing: sort again, naturally.	ACM SIGCSE Bull.	2005	DBLP DOI BibTeX RDF	mergesort, naturalmerge, sorting
80	Rakesh D. Barve, Jeffrey Scott Vitter	A Simple and Efficient Parallel Disk Mergesort.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
62	Salvador Roura	Improving Mergesort for Linked Lists.	ESA	1999	DBLP DOI BibTeX RDF
62	Jyrki Katajainen, Jesper Larsson Träff	A Meticulous Analysis of Mergesort Programs.	CIAC	1997	DBLP DOI BibTeX RDF
53	Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa	Register Efficient Mergesorting.	HiPC	2000	DBLP DOI BibTeX RDF
47	Michael T. Goodrich, S. Rao Kosaraju	Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation.	J. ACM	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.	PDP	2007	DBLP DOI BibTeX RDF
44	Hsien-Kuei Hwang	Asymptotic Expansions of the Mergesort Recurrences.	Acta Informatica	1998	DBLP DOI BibTeX RDF
44	Alistair Moffat, Ola Petersson, Nicholas C. Wormald	A Tree-Based Mergesort.	Acta Informatica	1998	DBLP DOI BibTeX RDF
36	Haihe Shi, Dawei Du, Jinyun Xue	Generating Algorithms plus Loop Invariants by Formal Derivation.	ACIS-ICIS	2008	DBLP DOI BibTeX RDF
36	Sanguthevar Rajasekaran	A Framework for Simple Sorting Algorithms on Parallel Disk Systems.	Theory Comput. Syst.	2001	DBLP DOI BibTeX RDF
29	Tadao Takaoka	Partial Solution and Entropy.	MFCS	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.	ACM SIGCSE Bull.	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.	CoRR	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.	World Wide Web	2021	DBLP DOI BibTeX RDF
26	Arif Arman, Dmitri Loguinov	Origami: A High-Performance Mergesort Framework. (PDF / PS)	Proc. VLDB Endow.	2021	DBLP DOI BibTeX RDF
26	Pedro Holanda, Stefan Manegold	Progressive Mergesort: Merging Batches of Appends into Progressive Indexes.	EDBT	2021	DBLP DOI BibTeX RDF
26	Albert Tedja	Sorting Lists with Equal Keys Using Mergesort in Linear Time.	CoRR	2020	DBLP BibTeX RDF
26	Naif Aljabri, Muhammad Abdulhamid Al-Hashimi, Mostafa Elsayed Saleh, Osama Ahmed Abulnaja	Investigating power efficiency of mergesort.	J. Supercomput.	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.	IEEE Access	2018	DBLP DOI BibTeX RDF
26	Arne Maus	A faster all parallel Mergesort algorithm for multicore processors.	NIK	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.	IEEE Access	2017	DBLP DOI BibTeX RDF
26	Marek A. Suchenek	Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV).	CoRR	2017	DBLP BibTeX RDF
26	Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert	An Efficient Multiway Mergesort for GPU Architectures.	CoRR	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.	HPCS	2017	DBLP DOI BibTeX RDF
26	Joonhee Lee, Hongchan Roh, Sanghyun Park 0003	External Mergesort for Flash-Based Solid State Drives.	IEEE Trans. Computers	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).	CoRR	2016	DBLP BibTeX RDF
26	K. Rustan M. Leino, Paqui Lucio	An Assertional Proof of the Stability and Correctness of Natural Mergesort.	ACM Trans. Comput. Log.	2015	DBLP DOI BibTeX RDF
26	Christian Sternagel	Proof Pearl - A Mechanized Proof of GHC's Mergesort.	J. Autom. Reason.	2013	DBLP DOI BibTeX RDF
26	Amr Elmasry, Jyrki Katajainen, Max Stenmark	Branch Mispredictions Don't Affect Mergesort.	SEA	2012	DBLP DOI BibTeX RDF
26	Christian Sternagel	Efficient Mergesort.	Arch. Formal Proofs	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.	Euro-Par (2)	2010	DBLP DOI BibTeX RDF
26	Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan 0005, Muralidaran Vijayaraghavan	High-throughput Pipelined Mergesort.	MEMOCODE	2008	DBLP DOI BibTeX RDF
26	Zhivko Prodanov Nedev, Tao Gong, Bryan Hill	Optimization problems in the implementation of distributed mergesort on networked computers.	Parallel and Distributed Computing and Networks	2004	DBLP BibTeX RDF
26	Gianni Franceschini	Proximity Mergesort: optimal in-place sorting in the cache-oblivious model.	SODA	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.	J. Algorithms	1999	DBLP DOI BibTeX RDF
26	Rakesh D. Barve, Jeffrey Scott Vitter	A Simple and Efficient Parallel Disk Mergesort.	SPAA	1999	DBLP DOI BibTeX RDF
26	Ian Parberry	Everything you wanted to know about the running time of Mergesort but were afraid to ask.	SIGACT News	1998	DBLP DOI BibTeX RDF
26	Weiye Zhang, Per-Åke Larson	Buffering and Read-Ahead Strategies for External Mergesort.	VLDB	1998	DBLP BibTeX RDF
26	Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter	Simple Randomized Mergesort on Parallel Disks.	Parallel Comput.	1997	DBLP DOI BibTeX RDF
26	Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter	Simple randomized Mergesort on parallel disks.	Randomization Methods in Algorithm Design	1997	DBLP DOI BibTeX RDF
26	Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik	Unfolding the Mystery of Mergesort.	LOPSTR	1997	DBLP DOI BibTeX RDF
26	Weiye Zhang, Per-Åke Larson	Dynamic Memory Adjustment for External Mergesort.	VLDB	1997	DBLP BibTeX RDF
26	LuoQuan Zheng, Per-Åke Larson	Speeding up External Mergesort.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF
26	Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola	Practical In-Place Mergesort.	Nord. J. Comput.	1996	DBLP BibTeX RDF
26	Hsien-Kuei Hwang	Limit theorems for mergesort.	Random Struct. Algorithms	1996	DBLP DOI BibTeX RDF
26	Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter	Simple Randomized Mergesort on Parallel Disks.	SPAA	1996	DBLP DOI BibTeX RDF
26	Wolfgang Panny, Helmut Prodinger	Bottom-Up Mergesort - a Detailed Analysis.	Algorithmica	1995	DBLP DOI BibTeX RDF
26	Philippe Flajolet, Mordecai J. Golin	Mellin Transforms and Asymptotics: The Mergesort Recurrence.	Acta Informatica	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.	Comput. Lang.	1994	DBLP DOI BibTeX RDF
26	Mordecai J. Golin, Robert Sedgewick	Queue-Mergesort.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
26	Svante Carlsson, Christos Levcopoulos, Ola Petersson	Sublinear Merging and Natural Mergesort.	Algorithmica	1993	DBLP DOI BibTeX RDF
26	Vinay S. Pai, Peter J. Varman	Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis.	ICDE	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.	ICPP (3)	1992	DBLP BibTeX RDF
26	Susan R. Wallace	Exploiting non-inherent parallelism in an internal mergesort.	ACM Southeast Regional Conference	1990	DBLP DOI BibTeX RDF
26	A. Inkeri Verkamo	Performance comparison of distributive and mergesort as external sorting algorithms.	J. Syst. Softw.	1989	DBLP DOI BibTeX RDF
26	Sai Choi Kwan, Jean-Loup Baer	The I/O Performance of Multiway Mergesort and Tag Sort.	IEEE Trans. Computers	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.	Algorithmica	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.	SODA	2009	DBLP DOI BibTeX RDF
18	Thomas Tuerk	A Formalisation of Smallfoot in HOL.	TPHOLs	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.	DMSN	2009	DBLP DOI BibTeX RDF
18	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz	On the adaptiveness of Quicksort.	ACM J. Exp. Algorithmics	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.	ACM J. Exp. Algorithmics	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.	Euro-Par Workshops	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.	SPAA	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.	ACM J. Exp. Algorithmics	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.	ESA	2006	DBLP DOI BibTeX RDF
18	Manuel Barbosa, Alcino Cunha, Jorge Sousa Pinto	Recursion patterns and time-analysis.	ACM SIGPLAN Notices	2005	DBLP DOI BibTeX RDF
18	Gerth Stølting Brodal, Gabriel Moruz	Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.	WADS	2005	DBLP DOI BibTeX RDF
18	Per-Åke Larson	External Sorting: Run Formation Revisited.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	replacement selection, run formation, External sorting, merge sort
18	Amr Elmasry	Three Sorting Algorithms Using Priority Queues.	ISAAC	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.	IPDPS	2003	DBLP DOI BibTeX RDF
18	Egon Börger, Tommaso Bolognesi	Remarks on Turbo ASMs for Functional Equations and Recursion Schemes.	Abstract State Machines	2003	DBLP DOI BibTeX RDF
18	Gerth Stølting Brodal, Rolf Fagerberg	On the limits of cache-obliviousness.	STOC	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.	J. ACM	2002	DBLP DOI BibTeX RDF	I/O complexity, lower bound, Hierarchical memory
18	Manish Gupta, Sayak Mukhopadhyay, Navin Sinha	Automatic Parallelization of Recursive Procedures.	IEEE PACT	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.	FOCS	1999	DBLP DOI BibTeX RDF
18	Axel Dold	Software Development in PVS Using Generic Development Steps.	Generic Programming	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.	SIGMOD Conference	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.	ICALP	1993	DBLP DOI BibTeX RDF