TUESDAY

  • 9:00 - 10:00 CHAIR: M. Karonski
    • S. Janson
      "Four methods and one theorem - another look at hashing with linear probing"
  • 10:00 - 10:30 BREAK

  • 10:20 - 12:30 CHAIR: M. Karonski
    • R. Kemp
      "On the Expected Number of Leftist Nodes in Simply Generated Trees"
    • B. Smythe
      "Stochastic Analysis of Shell Sort"
    • JF. Marckert
      "Parking with density"
    • E. Coffman
      "Probabilistic Analysis of Greedy Reservation Protocols"
  • 12:30 - 2:00 LUNCH

  • 2:00 - 4:00 CHAIR: C. Martinez
    • M. Karpinski
      "Improved Approximation of MAX-CUT on Graphs of Bounded Degree"
    • U. Rosler
      "A New Ultimate Convex Hull Algorithm in the Plane"
    • E. Sutinen
      "Evaluating the average filtration efficiency of a q-gram based approximate pattern matching algorithm"
    • M. Golin
      "New Upper and Lower Bounds on the Channel Capacity of Read/Write Isolated Memory"
  • 4:00 - 4:30 BREAK

  • 4:30 - 5:30 CHAIR: U. Rosler
    • D. Panario
      "Polynomials over Finite Fields Free from Large and Small Degree Irreducible Factors and Cryptographical Applications"
    • H. Wozniakowski
      "Average Case Complexity of Continuous Problems"
  • 5:30 - 6:00 BREAK

  • 6:00 CHAIR: P. Flajolet
    • OPEN PROBLEM SESSION