MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Subhash Suri" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

99 documents found, showing 1 through 10. Next 10 →

ATOM

P.: Simple robots with minimal sensing: From local visibility to global geometry
by Subhash Suri — 2007 — In: Proceedings of the TwentySecond National Conference on Artificial Intelligence and the Nineteenth Innovative Applications of Artificial Intelligence Conference, AAAI Press
…Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry Subhash Suri…
Cited by 1 (1 self) – Add To MetaCart

Optimal Clearing of Supply/Demand Curves
by Tuomas Sandholm, Subhash Suri — 2002 — In 13th annual International symposium on algorithms and computation
… rights reserved. Subhash Suri suri@(email omitted); Department of Computer Science University of California…
Cited by 14 (3 self) – Add To MetaCart

Rectangular Tiling in Multi-Dimensional Arrays
by Adam Smith, Subhash Suri — 1999 — In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 786–794
…Rectangular Tiling in Multi-Dimensional Arrays Adam Smith Subhash Suri Department of Computer…
Cited by 6 (0 self) – Add To MetaCart

Packet Filtering in High Speed Networks
by Subhash Suri, George Varghese — 1999 — In Proceedings of the Symposium on Discrete Algorithms
…Packet Filtering in High Speed Networks Subhash Suri y George Varghese z 1 Introduction…
Cited by 7 (0 self) – Add To MetaCart

Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract)
by John Hershberger, Subhash Suri — 1997 — In Proc. of the thirteenth annual symposium on Computational geometry
… ? and Subhash Suri ?? Abstract. Breakout routing is a single-layer wire-routing problem in which each of a set…
Cited by 1 (0 self) – Add To MetaCart

Practical Methods for Approximating Shortest Paths on a Convex Polytope in R³
by John Hershberger, Subhash Suri — 1995 — COMPUT. GEOM. THEORY APPL
… Mentor Graphics 1001 Ridder Park Drive San Jose, CA 95131. Subhash Suri Department of Computer Science…
Cited by 10 (0 self) – Add To MetaCart

Morphing Binary Trees
by John Hershberger, Subhash Suri — 1995 — In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms
…Morphing Binary Trees John Hershberger Mentor Graphics San Jose, CA 95131 Subhash Suri…
Cited by 4 (0 self) – Add To MetaCart

Finding a shortest diagonal of a simple polygon in linear time
by John Hershberger, Subhash Suri — 1993 — Computational Geometry: Theory and Applications
… Lytton Avenue, Palo Alto, California 94301 Subhash Suri Bellcore 445 South Street, Morristown, New…
Cited by 2 (1 self) – Add To MetaCart

Erratum to “Vickrey prices and shortest paths: What is an edge worth
by John Hershberger, Subhash Suri — 2002 — In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science
… in part by National Science Foundation grants IIS-0121562 and CCR-9901958. Subhash Suri £ Department…
Cited by 2 (1 self) – Add To MetaCart

Kinetic Connectivity of Rectangles
by John Hershberger, Subhash Suri — 1999 — In Proc. 15th Annu. ACM Sympos. Comput. Geom
… Wilsonville, OR 97070 john hershberger@(email omitted); Subhash Suri Department of Computer Science Washington…
Cited by 13 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB