sorting

---

sorting

Tag #sorting

131 papers:

SANER-2019-WhiteTMMP #learning #program repair

Sorting and Transforming Program Repair Ingredients via Deep Learning Code Similarities (MW, MT, MM, MM, DP), pp. 479–490.

ICML-2019-AnilLG #approximate

Sorting Out Lipschitz Function Approximation (CA, JL, RBG), pp. 291–301.

CASE-2019-LeeKH #modelling #order

Modelling a batch assorting operation for an autonomous cart in a parallel-aisle order assorting system (JL, YK, SH), pp. 60–65.

DLT-2018-GiancarloMRRS #word

Block Sorting-Based Transformations on Words: Beyond the Magic BWT (RG, GM, AR, GR, MS), pp. 1–17.

CIKM-2018-RajpalP #consistency #nondeterminism #optimisation

Holistic Crowd-Powered Sorting via AID: Optimizing for Accuracies, Inconsistencies, and Difficulties (SR, AGP), pp. 1607–1610.

ICML-2018-Mesaoudi-PaulHB #ranking

Ranking Distributions based on Noisy Sorting (AEMP, EH, RBF), pp. 3469–3477.

SIGMOD-2015-0002SLLF

Cache-Efficient Aggregation: Hashing Is Sorting (IM, PS, AL, WL, FF), pp. 1123–1136.

VLDB-2015-InoueT #algorithm #array

SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures (HI, KT), pp. 1274–1285.

LATA-2015-CodishCS #game studies #network

Sorting Networks: The End Game (MC, LCF, PSK), pp. 664–675.

VS-Games-2015-YohannisP #algorithm #gamification #learning #visualisation

Sort Attack: Visualization and Gamification of Sorting Algorithm Learning (AY, YP), pp. 1–8.

ICEIS-v2-2015-OliveiraF #enterprise #framework #overview #policy

A Spatial Data Infrastructure Review — Sorting the Actors and Policies from Enterprise Viewpoint (ILO, JLF), pp. 287–294.

LOPSTR-2015-CodishCNS #library #network

Applying Sorting Networks to Synthesize Optimized Sorting Libraries (MC, LCF, MN, PSK), pp. 127–142.

SAC-2015-CorcoglionitiRM #rdf #streaming #using

Processing billions of RDF triples on a single machine using streaming and sorting (FC, MR, MM, MA), pp. 368–375.

CASE-2015-BarlettaJCBR

Fostering sustainable electronic waste management through intelligent sorting equipment (IB, BJ, KC, MB, JR), pp. 459–461.

DAC-2015-JiangWS #clustering #power management

A low power unsupervised spike sorting accelerator insensitive to clustering initialization in sub-optimal feature space (ZJ, QW, MS), p. 6.

HPCA-2015-HayesPUCV #algorithm #architecture #novel

VSR sort: A novel vectorised sorting algorithm & architecture extensions for future microprocessors (TH, OP, OSÜ, AC, MV), pp. 26–38.

DLT-J-2013-BonomoMRRS14 #multi #word

Sorting conjugates and Suffixes of Words in a Multiset (SB, SM, AR, GR, MS), p. 1161–?.

LATA-2014-BundalaZ #network

Optimal Sorting Networks (DB, JZ), pp. 236–247.

LCT-NLE-2014-Said

Card Sorting Assessing User Attitude in E-Learning (GRES), pp. 261–272.

STOC-2014-Goodrich #algorithm

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.

ICDAR-2013-YanYWYYH #classification

Sorting-Based Dynamic Classifier Ensemble Selection (YY, XCY, ZBW, XY, CY, HWH), pp. 673–677.

DUXU-PMT-2013-ThomasJ

Merging Methodologies: Combining Individual and Group Card Sorting (RLT, IJ), pp. 417–426.

SIGMOD-2012-OhKKL

Reducing cache misses in hash join probing phase by pre-sorting strategy (GHO, JMK, WHK, SWL), p. 864.

ICSM-2012-IslamMSKS #algorithm #named #search-based #semantics #testing

MOTCP: A tool for the prioritization of test cases based on a sorting genetic algorithm and Latent Semantic Indexing (MMI, AM, AS, FBK, GS), pp. 654–657.

CIKM-2012-TranC #named #performance

SliceSort: efficient sorting of hierarchical data (QTT, CYC), pp. 2109–2113.

SAC-2012-DiasDHS #symmetry #using

Sorting genomes using almost-symmetric inversions (ZD, UD, LSH, JCS), pp. 1368–1374.

SAC-2012-Wu #memory management

Data sorting in flash memory (CHW), pp. 1847–1849.

DAC-2012-ZuluagaMP #generative #network #streaming

Computer generation of streaming sorting networks (MZ, PAM, MP), pp. 1245–1253.

ICSM-2011-HouP #api #code completion #evaluation

An evaluation of the strategies of sorting, filtering, and grouping API methods for Code Completion (DH, DMP), pp. 233–242.

ICALP-v1-2011-BulteauFR

Sorting by Transpositions Is Difficult (LB, GF, IR), pp. 654–665.

ICPC-2010-Taherkhani #algorithm #classification

Recognizing Sorting Algorithms with the C4.5 Decision Tree Classifier (AT), pp. 72–75.

ICALP-v1-2010-ColeR #multi

Resource Oblivious Sorting on Multicores (RC, VR), pp. 226–237.

ICALP-v1-2010-JimenezM

Interval Sorting (RMJ, CM), pp. 238–249.

SAC-2010-EyiyurekliBLB #self

Chemotaxis-based sorting of self-organizing heterotypic agents (ME, LB, PIL, DEB), pp. 1315–1322.

SAC-2010-GroppeG #database #scalability #semantics #web

External sorting for index construction of large semantic web databases (SG, JG), pp. 1373–1380.

STOC-2010-CardinalFJJM #algorithm

Sorting under partial information (without the ellipsoid algorithm) (JC, SF, GJ, RMJ, JIM), pp. 359–368.

ICALP-v1-2009-AjtaiFHN

Sorting and Selection with Imprecise Comparisons (MA, VF, AH, JN), pp. 37–48.

HCI-NIMT-2009-HurY #data analysis #multi #named

SimulSort: Multivariate Data Exploration through an Enhanced Sorting Technique (IH, JSY), pp. 684–693.

VLDB-2008-ChhuganiNLMHCBKD #architecture #cpu #implementation #manycore #performance

Efficient implementation of sorting on multi-core SIMD CPU architecture (JC, ADN, VWL, WM, MH, YKC, AB, SK, PD), pp. 1313–1324.

VLDB-2008-KoltsidasMV #memory management

Sorting hierarchical data in external memory for archiving (IK, HM, SV), pp. 1205–1216.

ITiCSE-2008-FurcyNW

Sorting out sorting: the sequel (DF, TLN, JW), pp. 174–178.

ICALP-A-2008-Ruzic #performance

Constructing Efficient Dictionaries in Close to Sorting Time (MR), pp. 84–95.

LATA-2008-Petersen #turing machine

Sorting and Element Distinctness on One-Way Turing Machines (HP), pp. 433–439.

ICFP-2008-Henglein #linear

Generic discrimination: sorting and paritioning unshared data in linear time (FH), pp. 91–102.

VLDB-2007-GedikBY #named #performance

CellSort: High Performance Sorting on the Cell Processor (BG, RB, PSY), pp. 1286–1207.

ICALP-2007-FranceschiniM

In-Place Suffix Sorting (GF, SM), pp. 533–545.

HCI-AS-2007-CaiX #design

Designing Product List on E-tailing Websites: The Effect of Sorting on Consumer Decision (SC, YX), pp. 104–113.

HCI-MIE-2007-HilligesKPBK #analysis #automation #classification #image #quality #using

Browsing and Sorting Digital Pictures Using Automatic Image Classification and Quality Analysis (OH, PK, AP, AB, HPK), pp. 882–891.

ECIR-2007-Silvestri #documentation #identifier #problem

Sorting Out the Document Identifier Assignment Problem (FS), pp. 101–112.

DATE-2007-KhanATE #algorithm #implementation #pipes and filters

A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems (ZK, TA, JST, ATE), pp. 1569–1574.

PDP-2007-HerruzoRBP #algorithm #parallel

A New Parallel Sorting Algorithm based on Odd-Even Mergesort (EH, GR, JIB, OGP), pp. 18–22.

SIGMOD-2006-GovindarajuGKM #database #named #performance #scalability

GPUTeraSort: high performance graphics co-processor sorting for large database management (NKG, JG, RK, DM), pp. 325–336.

ICALP-v1-2006-FinocchiGI #fault #memory management

Optimal Resilient Sorting and Searching in the Presence of Memory Faults (IF, FG, GFI), pp. 286–298.

ICPR-v1-2006-HansenMT #analysis #clustering #re-engineering

Cluster Analysis and Priority Sorting in Huge Point Clouds for Building Reconstruction (WvH, EM, UT), pp. 23–26.

PODS-2005-GroheS #bound #memory management #random

Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.

ICALP-2005-BrodalFM #adaptation

Cache-Aware and Cache-Oblivious Adaptive Sorting (GSB, RF, GM), pp. 576–588.

ICALP-2005-FranceschiniG

Optimal In-place Sorting of Vectors and Records (GF, RG), pp. 90–102.

GPCE-2005-Ahlander

Sorting Out the Relationships Between Pairs of Iterators, Values, and References (KÅ), pp. 342–356.

CGO-2005-LiGP #algorithm #optimisation #search-based

Optimizing Sorting with Genetic Algorithms (XL, MJG, DAP), pp. 99–110.

RE-2004-NurmulianiZW #requirements #using

Using Card Sorting Technique to Classify Requirements Change (NN, DZ, SPW), pp. 240–248.

CGO-2004-LiGP #library

A Dynamically Tuned Sorting Library (XL, MJG, DAP), pp. 111–124.

STOC-2004-FinocchiI #fault #memory management

Sorting and searching in the presence of memory faults (without redundancy) (IF, GFI), pp. 101–110.

STOC-2004-Yao #graph #problem #quantum

Graph entropy and quantum sorting problems (ACCY), pp. 112–117.

SIGMOD-2003-ChaudhuriKN #on the #relational #xml

On Relational Support for XML Publishing: Beyond Sorting and Tagging (SC, RK, JFN), pp. 611–622.

PDP-2003-Jimenex-GonzalezNL #named

CC-Radix: a Cache Conscious Sorting Based on Radix sort (DJG, JJN, JLLP), pp. 101–108.

STOC-2003-Klauck #quantum #trade-off

Quantum time-space tradeoffs for sorting (HK), pp. 69–76.

ICALP-2002-Elmasry #adaptation

Priority Queues, Pairing, and Adaptive Sorting (AE), pp. 183–194.

CIKM-2002-FarahatNC #estimation #named

AuGEAS: authoritativeness grading, estimation, and sorting (AF, GN, FC), pp. 194–202.

PDP-2002-Jimenez-GonzalezNL #algorithm #parallel

The Effect of Local Sort on Parallel Sorting Algorithms (DJG, JJN, JLLP), pp. 360–367.

STOC-2002-Han #linear

Deterministic sorting in O(nlog log n) time and linear space (YH), pp. 602–608.

ITiCSE-2001-Laxer #empirical

Treating computer science as science as: An experiment with sorting (CL), p. 189.

ICALP-2001-HoyerNS #order #quantum

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.

ICPR-v1-2000-ClavierTLDL #classification

Classifiers Combination for Forms Sorting (EC, ÉT, ML, SD, JL), pp. 1932–1935.

SAC-2000-BrestVZ #algorithm #clustering

A Sorting Algorithm on a PC Cluster (JB, AV, VZ), pp. 710–715.

SAC-2000-FeekinC #detection #using

Duplicate Detection Using K-way Sorting Method (AF, ZC), pp. 323–327.

HPDC-2000-NolteH #biology #case study #distributed #parallel #research

Parallel Matching and Sorting with TACO’s Distributed Collections — A Case Study from Molecular Biology Research (JN, PH), pp. 247–252.

ICDAR-1999-ClavierCL #approach #classification #image

Image Sorting — Image Classification: A Global Approach (EC, SC, JL), pp. 123–126.

ICDAR-1999-LeeL #automation #design #empirical #verification

Empirical Design of a Holistic Verifier for Automatic Sorting of Handwritten Singapore Postal Addresses (CKL, GL), pp. 733–736.

SIGMOD-1998-LarsonG #generative #memory management

Memory Management During Run Generation in External Sorting (PÅL, GG), pp. 472–483.

AFP-1998-Augusteijn98 #morphism

Sorting Morphisms (LA), pp. 1–27.

ICML-1998-BonetG #learning

Learning Sorting and Decision Trees with POMDPs (BB, HG), pp. 73–81.

ICPR-1998-HjaltasonRSW #modelling #ranking #recognition #using

Using spatial sorting and ranking in model-based object recognition (GRH, MR, HS, IW), pp. 1347–1349.

PDP-1998-GerbessiotisS #algorithm #case study

An experimental study of BSP sorting algorithms (AVG, CJS), pp. 479–485.

SIGMOD-1997-Arpaci-DusseauACHP #network

High-Performance Sorting on Networks of Workstations (ACAD, RHAD, DEC, JMH, DAP), pp. 243–254.

WIA-1997-Ziadi #automaton #clustering #problem #set

Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.

STOC-1997-ArgeFGV #memory management #on the #string

On Sorting Strings in External Memory (LA, PF, RG, JSV), pp. 540–548.

STOC-1997-MaggsV #multi

Improved Routing and Sorting on Multibutterflies (BMM, BV), pp. 517–530.

SIGMOD-1996-Agarwal #algorithm

A Super Scalar Sort Algorithm for RISC Processors (RCA), pp. 240–246.

WIA-1996-Schubert #automaton #how

How to Use Sorting Procedures to Minimize DFA (BS), pp. 159–166.

PDP-1996-SchikutaK #analysis #evaluation

Analysis and Evaluation of Sorting on Hypercube-Based Systems (ES, PK), pp. 258–265.

STOC-1996-Goodrich #parallel

Communication-Efficient Parallel Sorting (MTG), pp. 247–256.

STOC-1996-Ma #fault tolerance #network

An O(n log n)-Size Fault-Tolerant Sorting Network (YM), pp. 266–275.

STOC-1995-AnderssonHNR #linear #question

Sorting in linear time? (AA, TH, SN, RR), pp. 427–436.

STOC-1995-HannenhalliP #algorithm #permutation #polynomial

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals (SH, PAP), pp. 178–189.

STOC-1995-KahaleLMPSS #bound #network

Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.

ICALP-1994-PlaxtonS #bound #network

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.

SAC-1994-ZuhlkeL #automation #process

Application of fuzzy-logic in an automatic sorting process (DZ, ML), pp. 131–135.

EDAC-1994-AlexiouSK #composition #design #implementation

Design and Implementation of a High-Performance, Modular, Sorting Engine (GA, DS, NK), pp. 2–8.

STOC-1994-Hagerup #algorithm #parallel #string

Optimal parallel string algorithms: sorting, merging and computing the minimum (TH), pp. 382–391.

ICDAR-1993-ChouY #database #research

Sorting qualities of handwritten Chinese characters for setting up a research database (SLC, SSY), pp. 474–477.

VLDB-1993-PangCL #adaptation

Memory-Adaptive External Sorting (HP, MJC, ML), pp. 618–629.

CHI-1992-Brown #algorithm #parallel #visualisation

An Introduction to Zeus: Audiovisualization of Some Elementary Sequential and Parallel Sorting Algorithms (MHB), pp. 663–664.

STOC-1992-KahnK

Entropy and Sorting (JK, JHK), pp. 178–187.

STOC-1992-Plaxton #network

A Hypercubic Sorting Network with Nearly Logarithmic Depth (CGP), pp. 405–416.

STOC-1991-Hagerup #integer #parallel

Constant-Time Parallel Integer Sorting (TH), pp. 299–306.

ISLP-1991-LauP #product line #recursion #synthesis

Synthesis of a Family of Recursive Sorting Procedures (KKL, SDP), pp. 641–658.

ICALP-1990-MatiasV #integer #on the #parallel

On Parallel Hashing and Integer Sorting (YM, UV), pp. 729–743.

STOC-1990-CypherP

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (RC, CGP), pp. 193–203.

STOC-1990-GoddardKS #algorithm #random

Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.

VLDB-1989-LorieY #algorithm #communication #database #parallel

A Low Communication Sort Algorithm for a Parallel Database Machine (RAL, HCY), pp. 125–134.

VLDB-1989-SaakeLPW #information management #prototype

Sorting, Grouping and Duplicate Elimination in the Advanced Information Management Prototype (GS, VL, PP, LMW), pp. 307–316.

ICALP-1987-AggarwalV #complexity #problem

The I/O Complexity of Sorting and Related Problems (AA, JSV), pp. 467–478.

ICALP-1987-Dietzfelbinger #bound

Lower Bounds for Sorting of Sums (MD), pp. 457–466.

VLDB-1986-Menon #algorithm #case study #database #multi

A Study of Sort Algorithms for Multiprocessor Database Machines (JM0), pp. 197–206.

POPL-1986-LengauerH #concurrent #network #theorem

A Mechanically Certified Theorem about Optimal Concurrency of Sorting Networks (CL, CHH), pp. 307–317.

STOC-1986-SchnorrS #algorithm

An Optimal Sorting Algorithm for Mesh Connected Computers (CPS, AS), pp. 255–263.

CADE-1986-Traugott86a #deduction #source code #synthesis

Deductive Synthesis of Sorting Programs (JT), pp. 641–660.

ICALP-1985-BilardiP #complexity

The Influence of Key Length on the Area-Time Complexity of Sorting (GB, FPP), pp. 53–62.

STOC-1985-Alon

Expanders, Sorting in Rounds and Superconcentrators of Limited Depth (NA), pp. 98–102.

ICALP-1984-Mannila #algorithm #metric

Measures of Presortedness and Optimal Sorting Algorithms (HM), pp. 324–336.

STOC-1984-BilardiP #network

A Minimum Area VLSI Network for O(log n) Time Sorting (GB, FPP), pp. 64–70.

STOC-1984-Chazelle

Intersecting Is Easier than Sorting (BC), pp. 125–134.

STOC-1984-Leighton #bound #complexity #parallel

Tight Bounds on the Complexity of Parallel Sorting (FTL), pp. 71–80.

ICALP-1983-LangSSS #algorithm #performance

A Fast Sorting Algorithm for VLSI (HWL, MS, HS, HS), pp. 408–419.

STOC-1983-AjtaiKS #network

An O(n log n) Sorting Network (MA, JK, ES), pp. 1–9.

STOC-1982-BorodinH #modelling #parallel

Routing, Merging and Sorting on Parallel Models of Computation (AB, JEH), pp. 338–344.

VLDB-1981-Muraszkiewicz #array #concept

Concepts of Sorting and Projection in a Cellular Array (MM), pp. 76–80.

STOC-1980-BorodinC #trade-off

A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation (AB, SAC), pp. 294–301.

STOC-1976-ThompsonK #parallel

Sorting on a Mesh-Connected Parallel Computer (CDT, HTK), pp. 58–64.

STOC-1975-Fredman #probability

Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees (MLF), pp. 240–244.

STOC-1974-Horvath #performance

Efficient Stable Sorting with Minimal Extra Space (ECH), pp. 194–215.