All Stories

  1. Superreplication of Financial Derivatives via Convex Programming
  2. MODEL-INDEPENDENT LOWER BOUND ON VARIANCE SWAPS
  3. Super-Replication of Financial Derivatives Via Convex Programming
  4. Model-Independent Lower Bound on Variance Swaps
  5. SPARSE CALIBRATIONS OF CONTINGENT CLAIMS
  6. Analytic crossing probabilities for certain barriers by Brownian motion
  7. COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
  8. Greedy Dynamic Routing on Arrays
  9. Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
  10. Approximating the independence number via theϑ-function
  11. A semidefinite bound for mixing rates of Markov chains
  12. Large Deviation Bounds for Markov Chains
  13. A Spectral Technique for Coloring Random 3-Colorable Graphs
  14. Isoperimetric Inequalities and Eigenvalues
  15. Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
  16. A semidefinite bound for mixing rates of Markov chains
  17. Eigenvalues and expansion of regular graphs
  18. Lower bounds for sorting networks
  19. A spectral technique for coloring random 3-colorable graphs (preliminary version)
  20. On the second eigenvalue and linear expansion of regular graphs
  21. New modular properties of bell numbers
  22. Dynamic global packet routing in wireless networks
  23. Better expansion for Ramanujan graphs
  24. Fault diagnosis in a flash
  25. On the minimum distance of parallel and serially concatenated codes