Re: The Student Dropping Problem




Jerry --

I've always heard of this by the more politically correct name of the
"egg dropping" problem, and it's on lots of algorithms and math puzzle
lists. I know Bill Gasarch has talked about it, and I've seen it a
few other places as well. Don't know who would have talked about it
at STOC or FOCS though...


Jeremy Spinrad <spin@xxxxxxxxxxxxxxxxxxx> wrote:
> I am writing a survey on an under-taught algorithmic technique called balancing.
> Many years ago, I heard an entertaining talk at a FOCS or STOC problem on a
> search problem, which gave rise to an example I use when introducing the
> technique in my course (and once even got me in trouble when a student protested
> that it showed the insensitivity of professors towards students in our
> department!)
>
> In this talk, the speaker introduced the student dropping problem. You want to
> determine how high you can drop a student from an n story tower, and still have
> the student survive. If you have only one student to "work with", you must make n
> drops, floow by floor. However, given 2 students, you can drop the fisrt student
> every f(n) floors as long as the student survives, and drop the second studenty
> one floor at a time. The total number of drops is at most n/f(n) + f(n); to
> minimize this asymptocitcally you can set n/f(n) = f(n) and drop every sqrt(n)
> floors.
>
> You may notice similarity tosome other algorithms (eg Wigderson's approximate
> 3-coloring), because these are also examples of balancing.
>
> Can anyone tell me who the speaker in this talk was, and/or the search problem
> that he was really dealing with in the paper?
>
> Jerry Spinrad

--

That's News To Me!
newstome@xxxxxxxxxxx
.



Relevant Pages

  • Re: Second TI-Nspire report
    ... On your CAS algorithms remarks, I can give you a few hypothesis ... this very well constitues a weakness of the underlying software ... but if a student wants to experiment ...
    (comp.sys.hp48)
  • Re: Good algorithm for Inverse of cumulative Students t?
    ... I'm trying to set up a credit risk model that employees a Student t ... copula. ... For this purpose, I need algorithms for: ...
    (sci.stat.math)
  • Re: Induction with a hard start
    ... David C. Ullrich wrote: ... 101, where a student can pass just by learning to implement algorithms, even if he believes that it's possible to prove something is a subspace and also that it's not. ...
    (sci.math)
  • beginner
    ... i am a student. ... algorithms. ... for example red&black trees, huffman code. ...
    (comp.lang.cpp)
  • how to project implementation?
    ... i am a student. ... algorithms. ... for example red&black trees, huffman code. ...
    (alt.comp.lang.learn.c-cpp)