Waste Makes Haste: Tight Bounds for Loose Parallel Sorting

doi 10.1109/sfcs.1992.267788
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Tight Bounds for Parallel Randomized Load Balancing

2011English

Haste Makes Waste: The Interplay Between Dissolution and Precipitation of Supersaturating Formulations

AAPS Journal
Pharmaceutical Science
2015English

Haste Makes Waste: Decision Making in Patients With Restless Legs Syndrome With and Without Augmentation

PLoS ONE
Multidisciplinary
2017English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Tight Bounds for Testing Bipartiteness in General Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

The “Leaky Gut”: Tight Junctions but Loose Associations?

Digestive Diseases and Sciences
PhysiologyGastroenterology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy