ArticleslgStudy

computer science

Subhash Suri

Subhash Suri is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Subhash Suri rather than just read about it. In short: Subhash Suri (born July 7, 1960) is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.

Key takeaways

  • Subhash Suri belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Subhash Suri to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Subhash Suri from memory before moving on to harder problems.

Reference excerpt

Subhash Suri (born July 7, 1960) is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.

Education Suri did his undergraduate studies at the Indian Institute of Technology Roorkee, graduating in 1981. He then worked as a programmer in India before beginning his graduate studies in 1984 at Johns Hopkins University, where he earned a Ph.D. in computer science in 1987 under the supervision of Joseph O'Rourke.

Career He was a member of the technical staff at Bellcore until 1994, when he returned to academia as an associate professor at Washington University in St. Louis. He moved to a full professorship at UCSB in 2000. He was program committee chair for the 7th Annual International Symposium on Algorithms and Computation in 1996, and program committee co-chair for the 18th ACM Symposium on Computational Geometry in 2002.

Awards and honors Suri was elected as a fellow of the IEEE in 2009, of the Association for Computing Machinery in 2010, and of the American Association for the Advancement of Science in 2011.

Selected publications Srinivasan, V.; Suri, S.; Varghese, G. (1999), "Packet classification using tuple space search", Proceedings of the ACM SIGCOMM '99 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 135–146, CiteSeerX 10.1.1.357.2811, doi:10.1145/316188.316216, ISBN 978-1581131352, S2CID 207574370 {{citation}}: Cite uses deprecated parameter |citeseerx= (help) Hershberger, John; Suri, Subhash (1999), "An optimal algorithm for Euclidean shortest paths in the plane", SIAM Journal on Computing, 28 (6): 2215–2256, doi:10.1137/S0097539795289604, MR 1698954. Buragohain, Chiranjeeb; Agrawal, Divyakant; Suri, Subhash (2003), "A game theoretic framework for incentives in P2P systems", Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), pp. 48–56, arXiv:cs/0310039, doi:10.1109/PTP.2003.1231503, ISBN 978-0-7695-2023-0, S2CID 5110036. Jardosh, Amit; Belding-Royer, Elizabeth M.; Almeroth, Kevin C.; Suri, Subhash (2003), "Towards realistic mobility models for mobile ad hoc networks", Proceedings of the 9th International Conference on Mobile Computing and Networking (MobiCom '03), pp. 217–229, doi:10.1145/938985.939008, ISBN 978-1581137538, S2CID 747860. Shrivastava, Nisheeth; Buragohain, Chiranjeeb; Agrawal, Divyakant; Suri, Subhash (2004), "Medians and beyond: new aggregation techniques for sensor networks", Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys '04), pp. 239–249, doi:10.1145/1031495.1031524, ISBN 978-1581138795, S2CID 47110300. Hershberger, John; Maxel, Matthew; Suri, Subhash (2007). "Finding the k Shortest Simple Paths: A New Algorithm and its Implementation" (PDF). ACM Transactions on Algorithms. 3 (4). Article 45 (19 pages). doi:10.1145/1290672.1290682. S2CID 10703503.

References

External links Home page at UCSB

Worked examples

Example 1 — a first encounter with Subhash Suri

Start with the simplest possible case. Write down what Subhash Suri claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Subhash Suri before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Subhash Suri ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Subhash Suri

In research
Subhash Suri appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Subhash Suri in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Subhash Suri is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1960 births, 20th-century Indian mathematicians, American computer scientists, so understanding it makes those chapters shorter.
In everyday life
Look for Subhash Suri outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Subhash Suri in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Subhash Suri means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Subhash Suri out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Subhash Suri in simple terms?

Subhash Suri (born July 7, 1960) is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.

Why does Subhash Suri matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Subhash Suri?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Subhash Suri.

Tags

  • 1960 births
  • 20th-century Indian mathematicians
  • American computer scientists
  • Fellows of the American Association for the Advancement of Science
  • Fellows of the Association for Computing Machinery
  • Fellows of the IEEE
  • IIT Roorkee alumni
  • Indian computer scientists
  • Johns Hopkins University alumni
  • Living people
  • Researchers in geometric algorithms
  • University of California, Santa Barbara faculty

Keep exploring