Internet Mathematics

Internet Mathematics publishes research papers that address fundamental problems, both conceptual and algorithmic, that arise in dealing with large complex information networks such as the Internet.


Volume 1, Number 2

Publication Date: 2003

An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents

Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva Tardos; 129-150

Smaller Explicit Superconcentrators

N. Alon and M. Capalbo; 151-163

Admission Control to Minimize Rejections

Avrim Blum, Adam Kalai and Jon Kleinberg; 165-176

Guessing Secrets with Inner Product Questions

Fan Chung, Ronald Graham and Linyuan Lu; 177-192

Infinite Limits of Copying Models of the Web Graph

Anthony Bonato and Jeanette Janssen; 193-213

Coupling Scale-Free and Classical Random Graphs

Béla Bollobás and Oliver Riordan; 215-225

A Brief History of Generative Models for Power Law and Lognormal Distributions

Michael Mitzenmacher; 226-251

2013 © A K Peters, Ltd.