Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3614186

From MaRDI portal
Publication:4178501
Jump to:navigation, search

zbMATH Open0395.68054MaRDI QIDQ4178501FDOQ4178501


Authors: K. Mehlhorn Edit this on Wikidata


Publication date: 1979



Title of this publication is not available (Why is that?)




zbMATH Keywords

algorithmfilessorting


Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)



Cited In (16)

  • Sorting shuffled monotone sequences
  • Smoothsort's behavior on presorted sequences
  • Efficient fully-compressed sequence representations
  • Counting inversions adaptively
  • A note on adaptive parallel sorting
  • Adaptive sorting: an information theoretic perspective
  • A framework for adaptive sorting
  • Presorting algorithms: an average-case point of view
  • An optimal parallel adaptive sorting algorithm
  • A new measure of presortedness
  • Sorting roughly sorted sequences in parallel
  • Splitsort -- an adaptive sorting algorithm
  • Right invariant metrics and measures of presortedness
  • On partitions and presortedness of sequences
  • Title not available (Why is that?)
  • Smooth heaps and a dual view of self-adjusting data structures





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178501)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4178501&oldid=29990312"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 March 2024, at 19:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki