Search results for "sorted input"

Found 8 publication records. Showing 8 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model
1	Milan Ruzic	Making deterministic signatures quickly.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Deterministic algorithms, perfect hashing
1	Joakim Nivre	Sorting Out Dependency Parsing.	GoTAL	2008	DBLP DOI BibTeX RDF	non-projective dependency parsing, sorting, parsing
1	Walid G. Aref	Pipelined spatial join processing for quadtree-based indexes.	GIS	2007	DBLP DOI BibTeX RDF	spatial join algorithms, query optimization, spatial databases
1	Cesare Tinelli, Calogero G. Zarba	Combining Decision Procedures for Sorted Theories.	JELIA	2004	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Xiaobo Hu, Xiaodong Wu	Maximum Red/Blue Interval Matching with Applications.	COCOON	2001	DBLP DOI BibTeX RDF
1	Chen-Yi Lee, Jer-Min Tsai	A shift register architecture for high-speed data sorting.	VLSI Signal Processing	1995	DBLP DOI BibTeX RDF
1	Lee A. Hollaar	Specialized Merge Processor Networks for Combined Sorted Lists.	ACM Trans. Database Syst.	1978	DBLP DOI BibTeX RDF	backend processors, binary tree networks, computer system architecture, full text retrieval systems, inverted file databases, nonnumeric processing, pipelined networks, sorted list merging

Displaying result #1 - #8 of 8 (100 per page; Change: )