Publications | Yahoo! Research

BROWSE YAHOO! RESEARCH

Search by typing the name in the box:

Select a Project from the list below:

Search publications by:

Author:

Title:

Year:

Type:

Research Area:

Advanced Search

Publications

Publications | Technical Reports

Found 8 results

Filters: author is Martin [Clear All Filters]

2004

Topology discovery in heterogeneous IP networks: the \it etInventory system. Breitbart, Y.; Garofalakis, M.N.; Jai, B.; Martin, C.; Rastogi, R.; Silberschatz, A. , IEEE/ACM Trans. Netw., Volume 12, Number 3, p.401-414, (2004)

2003

A Real-Time Expectation Maximization Algorithm for Acquiring Multi-Planar Maps of Indoor Environments with Mobile Robots Thrun, S.; Martin, C.; Liu, Y.; Hahnel, D.; Emery-Montemerlo, R.; Chakrabarti, D.; Burgard, W. , IEEE Transactions on Robotics and Automation, (2003)

Universal Facility Location. Mahdian, M.; P\' al, M. , ESA, p.409-421, (2003)

1999

A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. Beame, P.; Borodin, A.; Raghavan, P.; Ruzzo, W.L.; Tompa, M. , SIAM J. Comput., Volume 28, Number 3, p.1051-1072, (1999)

1996

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Beame, P.; Borodin, A.; Raghavan, P.; Ruzzo, W.L.; Tompa, M. , Inf. Comput., Volume 130, Number 2, p.101-129, (1996)

1990

Time-Space Tradeoffs for Undirected Graph Traversal Beame, P.; Borodin, A.; Raghavan, P.; Ruzzo, W.L.; Tompa, M. , FOCS, p.429-438, (1990)

1989

Parallel Graph Algorithms That Are Efficient on Average Coppersmith, D.; Raghavan, P.; Tompa, M. , Inf. Comput., Volume 81, Number 3, p.318-333, (1989)

1987

Parallel Graph Algorithms that Are Efficient on Average Coppersmith, D.; Raghavan, P.; Tompa, M. , FOCS, p.260-269, (1987)