Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase binary comparisons (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-2008 (8)
Publication types (Num. hits)
article(4) inproceedings(4)
Venues (Conferences, Journals, ...)
J. ACM(2) Algorithmica(1) ICALP(1) IEEE Symposium on Computer Ari...(1) IEEE Trans. Knowl. Data Eng.(1) NIPS(1) SWAT(1)
Authors
Jan Neerbek(2) Peter Høyer(2) Yaoyun Shi(2) Arun K. Sood(1) David R. Karger(1) Derick Wood(1) Edgar M. Palmer(1) M. A. Rahimi(1) Mahdi Abdelguerfi(1) Mark G. Arnold(1) Nir Ailon(1) Philip N. Klein(1) Robert Endre Tarjan(1) Robert W. Robinson(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Nir Ailon Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking. Search on Bibsonomy NIPS The full citation details ... 2008 DBLP  BibTeX  RDF
1Mark G. Arnold The Residue Logarithmic Number System: Theory and Implementation. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Jan Neerbek, Yaoyun Shi Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Jan Neerbek, Yaoyun Shi Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1David R. Karger, Philip N. Klein, Robert Endre Tarjan A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF randomized algorithm, minimum spanning tree, matroid
1Mahdi Abdelguerfi, Arun K. Sood Computational Complexity of Sorting and Joining Relations with Duplicates. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 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
1Derick Wood Extremal Cost Tree Data Structures. Search on Bibsonomy SWAT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson Efficiency of a Binary Comparison Storage Technique. Search on Bibsonomy J. ACM The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.