The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Quicksort with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1961-1977 (16) 1978-1987 (15) 1988-1991 (17) 1992-1994 (15) 1995-1998 (15) 1999-2000 (15) 2001-2003 (25) 2004-2005 (25) 2006-2007 (16) 2008-2009 (27) 2010-2012 (16) 2013-2014 (15) 2015 (16) 2016 (15) 2017-2019 (20) 2020-2023 (10)
Publication types (Num. hits)
article(155) book(1) incollection(3) inproceedings(115) phdthesis(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 133 occurrences of 105 keywords

Results
Found 278 publication records. Showing 278 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
150Roger L. Wainwright Quicksort algorithms with an early exit for sorted subfiles. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
146Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz On the adaptiveness of Quicksort. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Adaptive sorting, Quicksort, branch mispredictions
103Branislav Durian Quicksort Without a Stack. Search on Bibsonomy MFCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF O(1)-space, Algorithm, Searching, Sorting, Stack, Quicksort
93Daniel Cederman, Philippas Tsigas A Practical Quicksort Algorithm for Graphics Processors. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
93Philippas Tsigas, Yi Zhang 0004 A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on SUN Enterprise 10000. Search on Bibsonomy PDP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
88Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler Randomized Quicksort and the Entropy of the Random Source. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Entropy, Randomized Algorithms, QuickSort
74Jean-Loup Baer, Yi-Bing Lin Improving Quicksort Performance with a Codewort Data Structure. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF codeword data structure, long, alphanumeric sequences, bytes, codeword generator, character count, first nonequal byte, quicksort algorithm, architecture-dependent parameters, in-line expansion, data structures, caches, sorting, compiler optimizations, register allocation, performance improvement, ordering, pointer, records, keys, swaps, write policies
68Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther Engineering a cache-oblivious sorting algorithm. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF funnelsort, quicksort, Cache-oblivious algorithms
64Bodo Manthey, Till Tantau Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
64Sangman Moh, Chansu Yu, Dongsoo Han Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors. Search on Bibsonomy ICCSA (4) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
54Domenico Cantone, Gianluca Cincotti QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF In-place sorting, heapsort, analysis of algorithms, quicksort
49Brigitte Vallée, Julien Clément 0001, James Allen Fill, Philippe Flajolet The Number of Symbol Comparisons in QuickSort and QuickSelect. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49James Allen Fill, Svante Janson The number of bit comparisons used by Quicksort: an average-case analysis. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
49Conrado Martínez, Salvador Roura Optimal Sampling Strategies in Quicksort. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
49Yi Pan 0001, Mounir Hamdi Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System. Search on Bibsonomy ISPAN The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
49Colin McDiarmid, Ryan Hayward Strong Concentration for Quicksort. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
45Bang Yang, Liliang Ren, Furong Chen, Xiaofan Liu Identification of Flow-Routing Sequence from DEMs Based on Quicksort. Search on Bibsonomy ESIAT (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF drainage networks, codification, DEM, quicksort, flow routing, hydrological model
45Maarten H. van Emden Algorithms 402: Increasing the efficiency of quicksort. Search on Bibsonomy Commun. ACM The full citation details ... 1970 DBLP  DOI  BibTeX  RDF sorting, quicksort
43Ravi Jain, David Molnar, Zulfikar Ramzan Towards understanding algorithmic factors affecting energy consumption: switching complexity, randomness, and preliminary experiments. Search on Bibsonomy DIALM-POMC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF randomness cost, switching cost, energy measurement
43Per-Åke Larson External Sorting: Run Formation Revisited. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF replacement selection, run formation, External sorting, merge sort
41Emanuele Manca, Andrea Manconi, Alessandro Orro, Giuliano Armano, Luciano Milanesi CUDA-quicksort: an improved GPU-based implementation of quicksort. Search on Bibsonomy Concurr. Comput. Pract. Exp. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
41Razvan Certezeanu, Sophia Drossopoulou, Benjamin Egelund-Müller, K. Rustan M. Leino, Sinduran Sivarajan, Mark J. Wheelhouse Quicksort Revisited - Verifying Alternative Versions of Quicksort. Search on Bibsonomy Theory and Practice of Formal Methods The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
41Sebastian Wild Quicksort mit zwei Pivots und mehr: Eine mathematische Analyse von Mehrwege-Partitionierungsverfahren und der Frage, wie Quicksort dadurch schneller wird. Search on Bibsonomy Ausgezeichnete Informatikdissertationen The full citation details ... 2016 DBLP  BibTeX  RDF
41Daniel Cederman, Philippas Tsigas GPU-Quicksort: A practical Quicksort algorithm for graphics processors. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi On Smoothed Analysis of Quicksort and Hoare's Find. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Eelis van der Weegen, James McKinna A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. Search on Bibsonomy TYPES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Kanela Kaligosi, Peter Sanders 0001 How Branch Mispredictions Affect Quicksort. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Rodolfo Torres-Velázquez, Vladimir Estivill-Castro A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem. Search on Bibsonomy EvoWorkshops The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Charles Knessl, Wojciech Szpankowski Quicksort Again Revisited. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
29Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper 0001 Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF scheduling, work stealing, futures, performance bounds
29Amr Elmasry, Abdelrahman Hammad Inversion-sensitive sorting algorithms in practice. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Adaptive sorting, Inversions
29Rebecca Wirfs-Brock Connecting Design with Code. Search on Bibsonomy IEEE Softw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Gilles Barthe, Benjamin Grégoire, Colin Riba Type-Based Termination with Sized Products. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Ezequiel Herruzo, Guillermo Ruíz, José Ignacio Benavides, Oscar G. Plata A New Parallel Sorting Algorithm based on Odd-Even Mergesort. Search on Bibsonomy PDP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Jie Liu 0026, Clinton Knowles, Adam Davis A Cost Optimal Parallel Quicksorting and Its Implementation on a Shared Memory Parallel Computer. Search on Bibsonomy ISPA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Peter Sanders 0001, Sebastian Winkel Super Scalar Sample Sort. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Stefan Edelkamp, Patrick Stiegeler Pushing the Limits in Sequential Sorting. Search on Bibsonomy WAE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
29Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ramakrishnan Rajamony, Willy Zwaenepoel A Comparison of Entry Consistency and Lazy Release Consistency Implementations. Search on Bibsonomy HPCA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF parallel computation, shared memory, performance measurement, networks of workstations, consistency models
25Darrah Chavey Double sorting: testing their sorting skills. Search on Bibsonomy SIGCSE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF cs1, sorting, selection, insertion, quicksort
25Timothy Furtak, José Nelson Amaral, Robert Niewiadomski Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF sorting, instruction-level parallelism, SIMD, vectorization, sorting networks, quicksort
25Ketan Mulmuley Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF expected running times, computational geometry, Voronoi diagram, pseudo-random generators, convex polytope, Quicksort, randomized incremental algorithms
20Riikka Numminen, Ileana Montoya Perez, Ivan Jambor, Tapio Pahikkala, Antti Airola Quicksort leave-pair-out cross-validation for ROC curve analysis. Search on Bibsonomy Comput. Stat. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Irvin Catic, Mehmed Mujic, Novica Nosovic, Tarik Hrnjic Enhancing Performance of CUDA Quicksort Through Pivot Selection and Branching Avoidance Methods. Search on Bibsonomy ICAT The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
20Daniel Langr, Klára Schovánková CPP11sort: A parallel quicksort based on C++ threading. Search on Bibsonomy Concurr. Comput. Pract. Exp. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Mark Blacher, Joachim Giesen, Peter Sanders 0001, Jan Wassenberg Vectorized and performance-portable Quicksort. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Jan Wassenberg, Mark Blacher, Joachim Giesen, Peter Sanders 0001 Vectorized and performance-portable quicksort. Search on Bibsonomy Softw. Pract. Exp. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
20Orson R. L. Peters Pattern-defeating Quicksort. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
20Shin-Cheng Mu, Tsung-Ju Chiang Deriving monadic quicksort (Declarative Pearl). Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
20Aryaf Al-Adwan, Rawan Zaghloul, Basel A. Mahafzah, Ahmad Abdel-Aziz Sharieh Parallel quicksort algorithm on OTIS hyper hexa-cell optoelectronic architecture. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
20Emanuele De Angelis, Fabio Fioravanti, Maurizio Proietti Transformational Verification of Quicksort. Search on Bibsonomy VPT/HCVS@ETAPS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
20Shin-Cheng Mu, Tsung-Ju Chiang Declarative Pearl: Deriving Monadic Quicksort. Search on Bibsonomy FLOPS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
20Stefan Edelkamp, Armin Weiß BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
20Shoupu Wan Loop Programming Practices that Simplify Quicksort Implementations. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
20YuKun Yao A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
20James Allen Fill, Wei-Chun Hung QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
20Ami Marowka Studying the Performance of Vector-Based Quicksort Algorithm. Search on Bibsonomy PPAM (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
20James Allen Fill, Wei-Chun Hung QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
20Jesper Larsson Träff Parallel Quicksort without Pairwise Element Exchange. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
20James Allen Fill, Wei-Chun Hung On the tails of the limiting QuickSort density. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
20Sebastian Wild Dual-pivot and beyond: The potential of multiway partitioning in quicksort. Search on Bibsonomy it Inf. Technol. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Michael Axtmann, Armin Wiebigke, Peter Sanders 0001 Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. Search on Bibsonomy IPDPS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Siyuan Ren, Shizhen Xu, Guangwen Yang A Parallel Quicksort Algorithm on Manycore Processors in Sunway TaihuLight. Search on Bibsonomy ICCS (3) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20James Allen Fill, Wei-Chun Hung On the Tails of the Limiting QuickSort Density. Search on Bibsonomy AofA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Ralph Neininger, Jasmin Straub Probabilistic Analysis of the Dual-Pivot Quicksort "Count". Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Sebastian Wild Quicksort Is Optimal For Many Equal Keys. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Shuo Yan, Jie Xue 0001, Xiyu Liu 0001 An Improved Quicksort Algorithm Based on Tissue-Like P Systems with Promoters. Search on Bibsonomy Int. Conf. on Membrane Computing The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
20Michael Axtmann, Armin Wiebigke, Peter Sanders 0001 Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
20Ralph Neininger, Jasmin Straub Probabilistic Analysis of the Dual-Pivot Quicksort "Count". Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
20Manuel Eberl The number of comparisons in QuickSort. Search on Bibsonomy Arch. Formal Proofs The full citation details ... 2017 DBLP  BibTeX  RDF
20Bernhard Beckert, Jonas Schiffl, Peter H. Schmitt, Mattias Ulbrich Proving JDK's Dual Pivot Quicksort Correct. Search on Bibsonomy VSTTE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
20Ratthaslip Ranokphanuwat, Surin Kittitornkun Parallel Partition and Merge QuickSort (PPMQSort) on Multicore CPUs. Search on Bibsonomy J. Supercomput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue How Good Is Multi-Pivot Quicksort? Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger Optimal Partitioning for Dual-Pivot Quicksort. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Markus E. Nebel, Sebastian Wild, Conrado Martínez Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
20Sebastian Wild Sorting Discrete i.i.d. Inputs: Quicksort is Optimal. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
20Noriyuki Kurosawa Quicksort with median of medians is considered practical. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
20Stefan Edelkamp, Armin Weiß BlockQuicksort: How Branch Mispredictions don't affect Quicksort. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
20Shay Gueron, Vlad Krasnov Fast Quicksort Implementation Using AVX Instructions. Search on Bibsonomy Comput. J. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Stefan Edelkamp, Armin Weiß BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20Sebastian Wild Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential (PDF / PS) Search on Bibsonomy 2016   RDF
20Sebastian Wild, Markus E. Nebel, Ralph Neininger Average Case and Distributional Analysis of Dual-Pivot Quicksort. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Vasileios Iliopoulos, David B. Penman Dual pivot Quicksort. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Martin Aumüller 0001, Martin Dietzfelbinger, Pascal Klaue How Good is Multi-Pivot Quicksort? Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Mathias Bæk Tejs Knudsen, Morten Stöckel Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Ammar Muqaddas Triple State QuickSort, A replacement for the C/C++ library qsort. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Guido Hartmann A numerical analysis of Quicksort: How many cases are bad cases? Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Vasileios Iliopoulos The Quicksort algorithm and related topics. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Svante Janson On the tails of the limiting Quicksort distribution. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Sebastian Wild Why Is Dual-Pivot Quicksort Fast? Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Michael Fuchs 0001 A note on the quicksort asymptotics. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Ralph Neininger Refined quicksort asymptotics. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Arne Maus A full parallel Quicksort algorithm for multicore processors. Search on Bibsonomy NIK The full citation details ... 2015 DBLP  BibTeX  RDF
20Mathias Bæk Tejs Knudsen, Morten Stöckel Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Amit Maor A Qualitative Analysis of Students' Difficulties with the Quicksort Algorithm Using Arrays (Abstract Only). Search on Bibsonomy SIGCSE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Conrado Martínez, Markus E. Nebel, Sebastian Wild Analysis of Branch Misses in Quicksort. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20Martin Aumüller 0001 On the Analysis of Two Fundamental Randomized Algorithms - Multi-Pivot Quicksort and Efficient Hash Functions. Search on Bibsonomy 2015   RDF
20Michael L. Fredman An intuitive and simple bounding argument for Quicksort. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 278 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license