Search results for "sorting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Jakob Pagter, Theis Rauhe	Optimal Time-Space Trade-Offs for Sorting.	FOCS	1998	DBLP DOI BibTeX RDF	comparison based, time-space, sorting, upper bounds, trade-off
34	Torben Hagerup	Sorting and Searching on the Word RAM.	STACS	1998	DBLP DOI BibTeX RDF	word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms
34	Sanguthevar Rajasekaran, Sartaj Sahni	Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	comparison problems, sorting, interprocessor communication, optical computing, mesh-connected computers, Reconfigurable networks
34	Andrea C. Dusseau, David E. Culler, Klaus E. Schauser, Richard P. Martin	Fast Parallel Sorting Under LogP: Experience with the CM-5.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	models of parallel computation, algorithm implementation, performance analysis, sorting, performance prediction, data layout, communication schedules, Massively parallel processing, communication performance
34	Jianli Sun, Jan Gecsei, Eduard Cerny	Fault-tolerance in balanced sorting networks.	J. Electron. Test.	1990	DBLP DOI BibTeX RDF	fault-tolerance, VLSI, parallel computing, sorting networks, shuffle-exchange
34	Arvin Park, Krishnaswamy Balasubramanian	Improved sorting algorithms for parallel computers.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF	linearly connected parallel computer, mesh-connected parallel computer, multiprocessor, SIMD, parallel sorting
32	Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier	Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.	IEEE ACM Trans. Comput. Biol. Bioinform.	2008	DBLP DOI BibTeX RDF	perfect sorting, sex chromosomes, evolution, genome rearrangements, sorting by reversals, common intervals, signed permutations
32	Sanguthevar Rajasekaran	Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	mesh with reconfigurable buses, mesh with fixed buses, k?k routing, k?k sorting, parallel computing, randomized algorithms, sorting, mesh, packet routing, Reconfigurable networks
32	Arne Andersson	Faster Deterministic Sorting and Searching in Linear Space.	FOCS	1996	DBLP DOI BibTeX RDF	deterministic sorting, unit-cost RAM, member search, neighbour search, fusion trees, complexity, data structure, searching, sorting, insert, delete, worst-case, perfect hashing, linear space
32	Hussein M. Alnuweiri	A New Class of Optimal Bounded-Degree VLSI Sorting Networks.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	VLSI sorting networks, optimal VLSI sorters, rotate-sort, enumeration-sort, reduced-area, K-shuffle layouts, VLSI, optimisation, logic design, sorting, time complexity, bounded-degree
32	Peter J. Varman, Kshitij A. Doshi	Sorting with Linear Speedup on a Pipelined Hypercube.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	linear speedup, pipelined hypercube, distributed-memory parallel architecture, coarse-grained parallel sorting algorithm, data communication problems, binary code architecture, parallel architectures, sorting, processing elements, communication mechanism
32	Mahdi Abdelguerfi, Arun K. Sood	Computational Complexity of Sorting and Joining Relations with Duplicates.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality
32	K. V. S. Ramarao	Distributed Sorting on Local Area Networks.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	distributed sorting, straight-line-topology local area network, worst-case communication complexity, computational complexity, lower bounds, distributed processing, sorting, local area networks, optimal algorithms
32	David Furcy, Thomas L. Naps, Jason Wentworth	Sorting out sorting: the sequel.	ITiCSE	2008	DBLP DOI BibTeX RDF	engagement level, visualization, interactivity, animation, pedagogy, flash
32	John G. Harris, José C. Príncipe, Justin C. Sanchez, Du Chen, Christy She	Pulse-based signal compression for implanted neural recording systems.	ISCAS	2008	DBLP DOI BibTeX RDF
32	Meena Mahajan, Raghavan Rama 0001, Vijayakumar Sundarrajan	Towards Constructing Optimal Strip Move Sequences.	COCOON	2004	DBLP DOI BibTeX RDF
32	David E. Simmen, Eugene J. Shekita, Timothy Malkemus	Fundamental Techniques for Order Optimization.	SIGMOD Conference	1996	DBLP DOI BibTeX RDF
31	Nadathur Satish, Changkyu Kim, Jatin Chhugani, Anthony D. Nguyen, Victor W. Lee, Daehyun Kim 0001, Pradeep Dubey	Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	merge network, tlp, performance, databases, sorting, buffer, merge, many-core, simd, radix
31	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
31	Chi-Wing Fu, Tien-Tsin Wong, Wai-Shun Tong, Chi-Keung Tang, Andrew J. Hanson	Binary-Space-Partitioned Images for Resolving Image-Based Visibility.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	segmentation, image-based rendering, binary space partitioning, Visibility sorting
31	Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Glenn Reinman	Scaling the issue window with look-ahead latency prediction.	ICS	2004	DBLP DOI BibTeX RDF	LHT, MNM, SILO, instruction sorting, CLP
31	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
31	Jeffrey Scott Vitter	External memory algorithms and data structures.	ACM Comput. Surv.	2001	DBLP DOI BibTeX RDF	multilevel memory, dynamic, sorting, block, B-tree, online, batched, I/O, out-of-core, disk, external memory, secondary storage, hierarchical memory, extendible hashing, multidimensional access methods
31	X. Zhao, Nigel J. Martin 0001, Roger G. Johnson	PPS - A Parallel Partition Sort Algorithm for Multiprocessor Database Systems.	DEXA Workshops	2000	DBLP DOI BibTeX RDF	parallel partition sort algorithm, multiprocessor database systems, workload imbalance, partition imbalance, heterogeneous imbalance, shared-nothing multiprocessor database environment, range intervals, fast internal sorting method, dynamic mechanism, interval sizes, dynamic mathematical model approach, data distribution estimation, parallel algorithms, skew, PPS
31	Koji Nakano, Stephan Olariu, James L. Schwing	Broadcast-Efficient Protocols for Mobile Radio Networks.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	Mobile radio networks, single-hop networks, DAMA, ranking, sorting, permutation routing
31	T. H. Merrett	Why Sort-Merge Gives the Best Implementation of the Natural Join.	SIGMOD Rec.	1983	DBLP DOI BibTeX RDF	mutual clustering, page-pair graphs, clustering, sorting, relational algebra, merging, natural join
29	Yoan Diekmann, Marie-France Sagot, Eric Tannier	Evolution under Reversals: Parsimony and Conservation of Common Intervals.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	perfect sorting, Computational biology, genome rearrangements, sorting by reversals, common intervals, signed permutations
29	Behrooz Parhami, Ching Yu Hung	Robust shearsort on incomplete bypass meshes.	IPPS	1995	DBLP DOI BibTeX RDF	robust shearsort, incomplete bypass meshes, incomplete 2-D bypass mesh, sorting scheme, shearsort, asymptotic time complexity, fault tolerance, parallel algorithms, computational complexity, fault tolerant computing, sorting, processing elements, reconfiguration schemes
29	Zhiyong Li 0002, Peter Mills, John H. Reif	Models and resource metrics for parallel and distributed computation.	HICSS (2)	1995	DBLP DOI BibTeX RDF	resource metrics, architectural details, generic parameters, network communication costs, LogP-HMM model, parameterized network model, sequential hierarchical memory model, multilevel memory, local cache, near-optimal sorting, parallel processing, parallel computation, distributed algorithms, distributed computation, resource allocation, sorting, fast Fourier transforms, parallel machines, memory hierarchy, cache storage, design principles, asynchrony, parallel models, input/output, synchronous models, fast Fourier transform algorithms
29	Bruce W. Weide, William F. Ogden, Murali Sitaraman	Recasting Algorithms to Encourage Reuse.	IEEE Softw.	1994	DBLP DOI BibTeX RDF	machine-oriented view, black-box reuse, spanning-forest algorithm, recasting, object-oriented programming, sorting, graph algorithm, objects, software reusability, sorting algorithm, performance trade-offs
29	Marília D. V. Braga, Jens Stoye	Counting All DCJ Sorting Scenarios.	RECOMB-CG	2009	DBLP DOI BibTeX RDF
29	Paolo Bertasi, Marco Bressan 0002, Enoch Peserico	psort, Yet Another Fast Stable Sorting Software.	SEA	2009	DBLP DOI BibTeX RDF
29	Tipraporn Thanakulwarapas, Jeeraporn Werapun	Dynamic Communication-Efficient Parallel Sorting on SMPs.	HPCC	2009	DBLP DOI BibTeX RDF
29	Ge Nong, Sen Zhang, Wai Hong Chan	Linear Suffix Array Construction by Almost Pure Induced-Sorting.	DCC	2009	DBLP DOI BibTeX RDF
29	Sanguthevar Rajasekaran, Sandeep Sen	Optimal and Practical Algorithms for Sorting on the PDM.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF
29	Li Teng 0002, Laiwan Chan	Discovering Biclusters by Iteratively Sorting with Weighted Correlation Coefficient in Gene Expression Data.	J. Signal Process. Syst.	2008	DBLP DOI BibTeX RDF	weighted correlation coefficient, gene expression data, biclustering, microarray data
29	Gary G. Yen, Wen-Fung Leong	A Sorting System for Hierarchical Grading of Diabetic Fundus Images: A Preliminary Study.	IEEE Trans. Inf. Technol. Biomed.	2008	DBLP DOI BibTeX RDF
29	Felix G. König, Marco E. Lübbecke	Sorting with Complete Networks of Stacks.	ISAAC	2008	DBLP DOI BibTeX RDF
29	Stefan Felsner, Martin Pergel	The Complexity of Sorting with Networks of Stacks and Queues.	ESA	2008	DBLP DOI BibTeX RDF
29	Ilan N. Goodman, Don H. Johnson	Information theoretic bounds on neural prosthesis effectiveness: The importance of spike sorting.	ICASSP	2008	DBLP DOI BibTeX RDF
29	Dolly Sharma, Vishal Thapar, Reda A. Ammar, Sanguthevar Rajasekaran, Mohamed Ahmed	Efficient sorting algorithms for the cell broadband engine.	ISCC	2008	DBLP DOI BibTeX RDF
29	Liping An, Lingyun Tong	A Dominance-Based Rough Set Approach to Multi-criteria Sorting Decision Analysis.	FSKD (4)	2008	DBLP DOI BibTeX RDF
29	Tatsuya Asai, Seishi Okamoto, Hiroki Arimura	An Adaptive Algorithm for Splitting Large Sets of Strings and Its Application to Efficient External Sorting.	PAKDD Workshops	2008	DBLP DOI BibTeX RDF
29	Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Takeda	Fast Computation of Zernike Moments For Rice Sorting System.	ICIP (6)	2007	DBLP DOI BibTeX RDF
29	Rongping Zeng, Jeffrey A. Fessler, James M. Balter, Peter A. Balter	Iterative Sorting for 4dct Images Based on Internal Anatomy Motion.	ISBI	2007	DBLP DOI BibTeX RDF
29	Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer	Improving the Average Delay of Sorting.	TAMC	2007	DBLP DOI BibTeX RDF
29	Gianni Franceschini, S. Muthukrishnan 0001	In-Place Suffix Sorting.	ICALP	2007	DBLP DOI BibTeX RDF
29	Nick Pilkington, Barry Irwin	An Investigation into the Performance of General Sorting on Graphics Processing Units.	SCSS (1)	2007	DBLP DOI BibTeX RDF
29	Stephan A. Hartmann, Thomas A. Runkler	Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization.	OR	2007	DBLP DOI BibTeX RDF
29	Gaowei Yan, Gang Xie 0001, Keming Xie, Tsau Young Lin	Granular Computing Based Sorting Method in Multi-Objective Optimization.	GrC	2007	DBLP DOI BibTeX RDF
29	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich	A Fast Suffix-Sorting Algorithm.	GTIT-C	2006	DBLP DOI BibTeX RDF
29	Qiang Guo, Xingzhou Zhang, Zheng Li	A Novel Sorting Method of Radar Signals Based on Support Vector Clustering and Delaminating Coupling.	IEEE ICCI	2006	DBLP DOI BibTeX RDF
29	Michal Ozery-Flato, Ron Shamir	An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations.	CPM	2006	DBLP DOI BibTeX RDF
29	Irene Finocchi, Fabrizio Grandoni 0001, Giuseppe F. Italiano	Optimal Resilient Sorting and Searching in the Presence of Memory Faults.	ICALP (1)	2006	DBLP DOI BibTeX RDF
29	Naga K. Govindaraju, Jim Gray 0001, Ritesh Kumar, Dinesh Manocha	GPUTeraSort: high performance graphics co-processor sorting for large database management.	SIGMOD Conference	2006	DBLP DOI BibTeX RDF
29	Yimin Wang, York Sure, Robert Stevens 0001, Alan L. Rector	Knowledge Elicitation Plug-In for Protégé: Card Sorting and Laddering.	ASWC	2006	DBLP DOI BibTeX RDF
29	Jan Korenek, Lukás Sekanina	Intrinsic Evolution of Sorting Networks: A Novel Complete Hardware Implementation for FPGAs.	ICES	2005	DBLP DOI BibTeX RDF
29	Osamu Nomura, Takashi Morie, Masakazu Matsugu, Atsushi Iwata	A Convolutional Neural Network VLSI Architecture Using Sorting Model for Reducing Multiply-and-Accumulation Operations.	ICNC (3)	2005	DBLP DOI BibTeX RDF
29	Gerth Stølting Brodal, Gabriel Moruz	Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.	WADS	2005	DBLP DOI BibTeX RDF
29	Thomas Hermle, Martin Bogdan, Cornelius Schwarz, Wolfgang Rosenstiel	ANN-Based System for Sorting Spike Waveforms Employing Refractory Periods.	ICANN (1)	2005	DBLP DOI BibTeX RDF
29	Ranjan Sinha, Justin Zobel	Using Random Sampling to Build Approximate Tries for Efficient String Sorting.	WEA	2004	DBLP DOI BibTeX RDF
29	Ranjan Sinha	Using Compact Tries for Cache-Efficient Sorting of Integers.	WEA	2004	DBLP DOI BibTeX RDF
29	Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter	Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.	CPM	2004	DBLP DOI BibTeX RDF
29	Gianni Franceschini, Roberto Grossi	No Sorting? Better Searching!	FOCS	2004	DBLP DOI BibTeX RDF
29	Gianni Franceschini, Viliam Geffert	An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.	FOCS	2003	DBLP DOI BibTeX RDF
29	Amitava Datta, Subbiah Soundaralakshmi	Fast Merging and Sorting on a Partitioned Optical Passive Stars Network.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
29	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
29	Mitali Singh, Viktor K. Prasanna	Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network.	PerCom	2003	DBLP DOI BibTeX RDF
29	Minsoo Jeon, Dongseung Kim	Distribution-Insensitive Parallel External Sorting on PC Clusters.	ISHPC	2003	DBLP DOI BibTeX RDF
29	Yijie Han, Mikkel Thorup	Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space.	FOCS	2002	DBLP DOI BibTeX RDF
29	Harald Räcke, Christian Sohler, Matthias Westermann	Online Scheduling for Sorting Buffers.	ESA	2002	DBLP DOI BibTeX RDF
29	Chi-Sheng Lin, Bin-Da Liu	Design of a pipelined and expandable sorting architecture with simple control scheme.	ISCAS (4)	2002	DBLP DOI BibTeX RDF
29	Bala Ravikumar	A Fault-Tolerant Merge Sorting Algorithm.	COCOON	2002	DBLP DOI BibTeX RDF
29	Samar Sharma, Rina Panigrahy	Sorting and Searching Using Ternary CAMs.	Hot Interconnects	2002	DBLP DOI BibTeX RDF
29	Chris Melhuish, Matt Wilson, Ana B. Sendova-Franks	Patch Sorting: Multi-object Clustering Using Minimalist Robots.	ECAL	2001	DBLP DOI BibTeX RDF
29	Yijie Han	Improved fast integer sorting in linear space.	SODA	2001	DBLP BibTeX RDF
29	R. Yugo Kartono Isal, Alistair Moffat	Word-Based Block-Sorting Text Compression.	ACSC	2001	DBLP DOI BibTeX RDF
29	Kenneth Y. Yun, Kevin W. James, Robert H. Fairlie-Cuninghame, Supratik Chakraborty, Rene L. Cruz	A self-timed real-time sorting network.	IEEE Trans. Very Large Scale Integr. Syst.	2000	DBLP DOI BibTeX RDF
29	Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier	Analytic Variations on Bucket Selection and Sorting.	Acta Informatica	2000	DBLP DOI BibTeX RDF
29	Walid G. Aref, Ibrahim Kamel	On Multi-dimensional Sorting Orders.	DEXA	2000	DBLP DOI BibTeX RDF
29	Naila Rahman, Rajeev Raman	Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms.	ESA	2000	DBLP DOI BibTeX RDF
29	Andre Osterloh	Sorting on the OTIS-Mesh.	IPDPS	2000	DBLP DOI BibTeX RDF
29	Sridhar Hannenhalli, Pavel A. Pevzner	Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals.	J. ACM	1999	DBLP DOI BibTeX RDF	computational biology, genetics
29	Naila Rahman, Rajeev Raman	Analysing Cache Effects in Distribution Sorting.	WAE	1999	DBLP DOI BibTeX RDF
29	Christophe Cérin, Jean-Luc Gaudiot	Algorithms for Stable Sorting to Minimize Communications in Networks of Workstations and Their Implementations in BSP.	IWCC	1999	DBLP DOI BibTeX RDF	foundations of parallel languages, bulk synchronous parallel model and broadcasting with selective reduction model. algorithms for solving problems on clusters, job and resource management, parallel programming
29	Kamal Kantawala, Dali L. Tao	Design, analysis, and evaluation of concurrent checking sorting networks.	IEEE Trans. Very Large Scale Integr. Syst.	1997	DBLP DOI BibTeX RDF
29	De-Lei Lee, Kenneth E. Batcher	A Multiway Merge Sorting Network.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
29	Chaitali Chakrabarti, Li-Yu Wang	Novel sorting network-based architectures for rank order filters.	IEEE Trans. Very Large Scale Integr. Syst.	1994	DBLP DOI BibTeX RDF
29	Marcin Kik, Miroslaw Kutylowski, Grzegorz Stachowiak	Periodic Constant Depth Sorting Networks.	STACS	1994	DBLP DOI BibTeX RDF
29	Vladimir Estivill-Castro, Derick Wood	Foundations for Faster External Sorting (Extended Abstract).	FSTTCS	1994	DBLP DOI BibTeX RDF
29	Torsten Suel	Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes.	SPAA	1994	DBLP DOI BibTeX RDF
29	Ornan Ori Gerstel, Shmuel Zaks	The Bit Complexity of Distributed Sorting (Extended Abstract).	ESA	1993	DBLP DOI BibTeX RDF
29	Jingsen Chen, Christos Levcopoulos	Improved Parallel Sorting of Presorted Sequences.	CONPAR	1992	DBLP DOI BibTeX RDF
29	Ola Petersson, Alistair Moffat	A Framework for Adaptive Sorting.	SWAT	1992	DBLP DOI BibTeX RDF
29	Bogdan S. Chlebus	Duplicating keys to streamline sorting on a mesh-connected computer.	SPDP	1991	DBLP DOI BibTeX RDF
29	Vladimir Estivill-Castro, Derick Wood	Practical Adaptive Sorting.	ICCI	1991	DBLP DOI BibTeX RDF
29	Glenn K. Manacher, Tien Dai Bui, Mai Thanh	Optimum combinations of sorting and merging.	J. ACM	1989	DBLP DOI BibTeX RDF
29	Kazem U. Ahmed, Der-Yun Yeh	A Note on Conway's Parallel Sorting Algorithm.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
29	Christos Levcopoulos	On Optimal Parallel Algorithm for Sorting Presorted Files.	FSTTCS	1988	DBLP DOI BibTeX RDF
29	Martin Dietzfelbinger	Lower Bounds for Sorting of Sums.	ICALP	1987	DBLP DOI BibTeX RDF