The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1983-2023 (12)
Publication types (Num. hits)
article(6) inproceedings(6)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
61Mikkel Bundgaard, Vladimiro Sassone Typed polyadic pi-calculus in bigraphs. Search on Bibsonomy PPDP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Bigraphs, bisimulation congruences, foundation of computation, foundations of distributed and mobile systems, relative pushouts, subsorting, typed polyadic ?-calculus, sortings, semantics of concurrency
60Lars Birkedal, Søren Debois, Thomas T. Hildebrandt Sortings for Reactive Systems. Search on Bibsonomy CONCUR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
49Lars Birkedal, Søren Debois, Thomas T. Hildebrandt On the Construction of Sorted Reactive Systems. Search on Bibsonomy CONCUR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Tomoyuki Tokuue, Tomoaki Ishiyama Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku. Search on Bibsonomy J. Inf. Process. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
36Tomoyuki Tokuue, Tomoaki Ishiyama Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
36Ladislav Végh, Veronika Stoffová Algorithm Animations for Teaching and Learning the Main Ideas of Basic Sortings. Search on Bibsonomy Informatics Educ. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
36Noëlle Bleuzen-Guernalec, Alain Colmerauer Optimal Narrowing of a Block of Sortings in Optimal Time. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
36Noëlle Bleuzen-Guernalec, Alain Colmerauer Narrowing a Block of Sortings in Quadratic Time. Search on Bibsonomy CP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
36Alan D. Kalvin, Yaakov L. Varol On the Generation of All Topological Sortings. Search on Bibsonomy J. Algorithms The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
25Sanpawat Kantabutra, Wattana Jindaluang, Prapaporn Techa-angkoon It's Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network. Search on Bibsonomy ISPA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Jeffry L. Hirst Reverse mathematics and rank functions for directed graphs. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
25Fabio Ancona, Giorgio Oddone, Stefano Rovetta, Gianni Uneddu, Rodolfo Zunino VLSI Architectures for Programmable Sorting of Analog Quantities with Multiple-Chip Support. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
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