Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry

Eitan Bachmat

Type: Article

Publication Date: 2007-09-07

Citations: 8

DOI: https://doi.org/10.1007/s00453-007-9017-6

View Publication

Locations

Algorithmica - View

Similar Works

Action	Title	Year	Authors
+	Average case analysis for batched disk scheduling and increasing subsequences	2001	Eitan Bachmat
+	Worst Case Analysis of Bach Arrivals with the Increasing Convex Ordering	2006	Ana Bušić Fourneau Jean-Michel Nihal Pekergin
+	Asymptotic average shadowing property on compact metric spaces	2007	Bahman Honary Alireza Zamani Bahabadi
+	Topics in Asymptotic Geometric Analysis and Applications	2019
+ PDF Chat	On the Line-Separable Unit-Disk Coverage and Related Problems	2024	Gang Liu Haitao Wang
+	Approximation on a disk I	1993	Anthony G. O’Farrell J. P. de Paepe
+	Improved bounds for the disk-packing constant	1973	David W. Boyd
+	The disk-packing constant	1971	David W. Boyd
+	The disk-packing constant	1971	David W. Boyd
+ PDF Chat	Optimal analytic disks	1991	J. William Helton Orlando Merino
+	Improved bound for the disk-packing constant	1973	David W. Boyd
+	Asymptotic Geometric Analysis, Part II	2021	Shiri Artstein-Avidan Apostolos Giannopoulos Vitali Milman
+ PDF Chat	Approximation on a disk II	1993	Anthony G. O’Farrell J. P. de Paepe
+	Packings in two dimensions: Asymptotic average-case analysis of algorithms	1993	E. G. Coffman Peter W. Shor
+	Approximation on a disk	1964	John Wermer
+	Asymptotic Geometric Analysis, Part I	2015	Shiri Artstein-Avidan Apostolos Giannopoulos Vitali Milman
+ PDF Chat	Book Review: Asymptotic geometric analysis, Part I	2016	Gideon Schechtman
+ PDF Chat	Average case analysis for batched disk scheduling and increasing subsequences	2002	Eitan Bachmat
+	Distribution-free bounds on the expectation of the maximum with scheduling applications	1990	Peter J. Downey
+ PDF Chat	The asymptotic Berry - Esseen constant for intervals	2012	Todor Dinev Todor Dinev Lutz Mattner Lutz Mattner

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	Optimal boarding policies for thin passengers	2007	Eitan Bachmat Daniel Berend Luba Sapir Steven Skiena
+ PDF Chat	Optimal boarding policies for thin passengers	2007	Eitan Bachmat Daniel Berend Luba Sapir Steven Skiena
+	Analysis of the GSTF disk scheduling algorithm	2014	Eitan Bachmat Ilan Elhanan
+	Discrete spacetime and its applications	2007	Eitan Bachmat
+	Optimal back-to-front airplane boarding	2013	Eitan Bachmat Vassilii Khachaturov Ran Kuperman

Works Cited by This (13)

Action	Title	Year	Authors
+	Discrete spacetime and its applications	2007	Eitan Bachmat
+	On the distribution of the length of the longest increasing subsequence of random permutations	1999	Jinho Baik Percy Deift Kurt Johansson
+ PDF Chat	Analysis of aeroplane boarding via spacetime geometry and random matrix theory	2006	Eitan Bachmat Daniel Berend Luba Sapir Steven Skiena Natan Stolyarov
+ PDF Chat	Connect the dots: how many random points can a regular curve pass through?	2005	Ery Arias-Castro David L. Donoho Xiaoming Huo Craig A. Tovey
+ PDF Chat	Limiting Curves for I.I.D. Records	1995	Jean‐Dominique Deuschel Ofer Zeitouni
+	Box-spaces and random partial orders	1991	Béla Bollobás Graham Brightwell
+ PDF Chat	Average case analysis for batched disk scheduling and increasing subsequences	2002	Eitan Bachmat
+ PDF Chat	Transversal fluctuations for increasing subsequences on the plane	2000	Kurt Johansson
+ PDF Chat	Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem	1999	David Aldous Persi Diaconis
+	Spacetime and geometry	2004	Sean M. Carroll