Ashish Goel is an American professor whose research focuses on the design, analysis and applications of algorithms. He is a professor of Management Science and Engineering (and by courtesy Computer Science) at Stanford University. [1]
Ashish Goel is an American professor whose research focuses on the design, analysis and applications of algorithms. He is a professor of Management Science and Engineering (and by courtesy Computer Science) at Stanford University. [1]
Ashish Goel was born in Uttar Pradesh in India. He did his schooling at Uttar Pradesh including at St. Peter's, Agra. He was ranked first in IIT JEE 1990. [2] [3] He graduated with a B.Tech in Computer Science from IIT Kanpur in 1994. He then went on to obtain a Ph.D. in Computer Science from Stanford University in 1999. [1]
Ashish Goel's research has spanned algorithmic problems in several areas of computer science and computational social science including computer networks, theoretical computer science, molecular self-assembly, algorithmic game theory, and computational social choice.
Ashish Goel's early work resolved several open algorithmic problems in graph theory and computer networks including showing that the scheduling protocol FIFO can result in instability at arbitrarily low rates in a packet network; [4] showing that matching in regular bipartite graphs can be computed in time nearly linear in the number of vertices (i.e. without looking at all the edges); [5] showing that every monotone graph property has a sharp threshold in geometric random graphs; [6] and showing that in a packet switch, output queuing (the gold standard) can be simulated using a fabric that is twice as fast as an input-queued switch. [7]
Goel along with Rajeev Motwani and Gagan Aggarwal gave the first comprehensive analysis of how the auction used by Google to price search keywords can be made truthful. [8] This work was co-awarded the ACM SigECOMM test of time award in 2018. [9] Another paper in computational advertising received the best paper award at The Web Conference 2009. [10]
Goel has had made contributions to algorithms and software related to personalization, online advertising and decentralized finance, and has been associated with companies such as Twitter, Stripe, Coinbase,[ citation needed ] and Infosys [11] [12] as an advisor/consultant.
From 2009 to 2010, he worked for Twitter when the company was small. He designed all of Twitter's early personalization products and was credited by ex-Twitter CEO Dick Costolo for designing its monetization model. [13] His research have also received coverage in mainstream media. [14] [15]
Goel's research has focused on building software systems that enable constructive online conversation and collaboration on important, often contentious, socio-political issues.
In computer science, the clique problem is the computational problem of finding cliques in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique, finding a maximum weight clique in a weighted graph, listing all maximal cliques, and solving the decision problem of testing whether a graph contains a clique larger than a given size.
John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation and data structures are regarded as standards in their fields. He is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, Co-Director of the Center on Frontiers of Computing Studies at Peking University, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Sambasiva Rao Kosaraju is an Indian-American professor of computer science at Johns Hopkins University, and division director for Computing & Communication Foundations at the National Science Foundation. He has done extensive work in the design and analysis of parallel and sequential algorithms.
Maximum cardinality matching is a fundamental problem in graph theory. We are given a graph G, and the goal is to find a matching containing as many edges as possible; that is, a maximum cardinality subset of the edges such that each vertex is adjacent to at most one edge of the subset. As each edge will cover exactly two vertices, this problem is equivalent to the task of finding a matching that covers as many vertices as possible.
Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.
Zvi Galil is an Israeli-American computer scientist and mathematician. Galil served as the president of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing. His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification. He has published over 200 scientific papers and is listed as an ISI highly cited researcher.
Omer Reingold is an Israeli computer scientist. He is the Rajeev Motwani professor of Computer Science in the Computer Science Department at Stanford University and the director of the Simons Collaboration on the Theory of Algorithmic Fairness. He received a PhD in computer science at Weizmann in 1998 under Moni Naor. He received the 2005 Grace Murray Hopper Award for his work in finding a deterministic logarithmic-space algorithm for st-connectivity in undirected graphs. He, along with Avi Wigderson and Salil Vadhan, won the Gödel Prize (2009) for their work on the zig-zag product. He became a Fellow of the Association for Computing Machinery in 2014 "For contributions to the study of pseudorandomness, derandomization, and cryptography."
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Algorithmic game theory (AGT) is an area in the intersection of game theory and computer science, with the objective of understanding and design of algorithms in strategic environments.
Rajeev Motwani was an Indian American professor of Computer Science at Stanford University whose research focused on theoretical computer science. He was a special advisor to Sequoia Capital. He was a winner of the Gödel Prize in 2001.
Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random-access machine in which the machine word size is assumed to match the problem size. The model was proposed by Michael Fredman and Dan Willard, who chose its name "because the dichotomy between the machine model and the problem size is crossed in a reasonable manner."
Prabhakar Raghavan is a senior vice president at Google, where he is responsible for Google Search, Assistant, Geo, Ads, Commerce, and Payments products. His research spans algorithms, web search and databases and he is the co-author of the textbooks Randomized Algorithms with Rajeev Motwani and Introduction to Information Retrieval.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
In economics, a budget-additive valuation is a kind of a utility function. It corresponds to a person that, when given a set of items, evaluates them in the following way:
Harold N. (Hal) Gabow is an American computer scientist known for his research on graph algorithms and data structures. He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.
Philip N. Klein is an American computer scientist and professor at Brown University. His research focuses on algorithms for optimization problems in graphs.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
