DOCSLIB.ORG

FOCS '94 the 35Thannual IEEE Conference on Foundations Of

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
FOCS '94 the 35Thannual IEEE Conference on Foundations Of Registration for FOCS '94 The registration fees for FOCS '94 are listed below. To th qualify for the early registration fee, your registration ap- FOCS '94 The 35 Annual plication must be postmarked by Thursday, October 20. Refund requests will be honored until November 4. The non-student registration fee includes the Saturday night reception, the Sunday night business meeting, the Monday night banquet, coffee breaks and lunches, and a copy of the proceedings. The student fee includes all of the above except the banquet. Please fill out the form below and send it, along with a check or money order IEEE Conference on (in US $, drawn on a US bank) made payable to \IEEE Foundations of Computer Science - FOCS '94 Symposium," to: Sorin Istrail Attn: FOCS registration Sandia National Laboratories Department 1423, Mail Stop 1110 Albuquerque, NM 87185-1110 November 20 { 22, 1994 Name Affiliation Street Address CityState ZIP or Country & Postal code E-mail Phone Please circle one category below and fill in your membership number if appropriate: Category Fee After 10/20 ACM or SIGACT member 280 335 IEEE or EATCS member 280 335 # Author or Program Committee 280 335 Student 110 130 Other 300 360 Extra Banquet Tickets ×$50 each = Total registration Machtey Fund Contributions ($5 suggested) Santa Fe, New Mexico (Make separate check to Machtey Award Fund) Dietary restrictions: Kosher Vegetarian None Special needs (attach letter if necessary) Sponsored by The IEEE Computer Society In cooperation with ACM SIGACT Hotel Reservations SATURDAY, NOVEMBER 19, 1994 Outdoor Activity (see Optional Events) The conference will be held at the Eldorado Hotel in Reception: 8 pm{11 pm, Eldorado Hotel Santa Fe. The rates for IEEE FOCS '94 are posted be- low and apply from Wednesday, November 16 through SUNDAY, NOVEMBER 20, 1994 Thursday, November 24, pre and post days on a space available basis. Checkin time is 4:00 p.m. and checkout is 11:30 a.m. Please advise the hotel of late arrival. Santa Sunday Session 1a { chair L. Lovasz Fe is a popular destination; please call soon. Reser- vations should be made by Wednesday, October 5. Approximate Graph Coloring by Semidefinite Reservations made after that will be accepted on a rate Programming: David Karger, Rajeev Motwani, and space availability basis. Refer to IEEE FOCS '94 Madhu Sudan. Finding Separator Cuts in Planar when making reservations to obtain the rates listed. To Graphs Within Twice the Optimal: Naveen Garg, make your reservations by phone, call 1-800-955-4455 or Huzur Saran, Vijay V. Vazirani. Polynomial 505-988-4455 or fax 505-988-5376. To make reservations Time Randomized Approximation Schemes for by mail or fax, fill out the form below and send it to the the Tutte Polynomial of Dense Graphs: Noga address below. A deposit in the form of a check or money Alon, Alan Frieze, Dominic Welsh. A Note on order for one night's stay, or credit card information and the θ Number of Lovasz and the Generalized Del- your return phone and/or fax must be included. When sarte Bound: Mario Szegedy filling out the form, make sure that you list your name exactly as it appears on your check or credit card. The 9:009:259:5010:15Sunday Session 1b { chair A. Blum following credit cards are accepted: American Express, Diners Club, Visa, Mastercard, and Discover. Deposits An Efficient Membership-Query Algorithm for will be refunded if the hotel is notified at least 72 hours Learning DNF with Respect to the Uniform Dis- before your specified arrival. tribution: Jeffrey Jackson. On Learning Dis- Eldorado Hotel cretized Geometric Concepts: Nader H. Bshouty, Attn: IEEE FOCS '94 Reservations Zhixiang Chen, Steven Homer. PAC Learn- 309 West San Francisco ing with Irrelevant Attributes: Aditi Dhagat, Santa Fe, NM 87501 Lisa Hellerstein. The Power of Team Explo- ration: Two Robots Can Learn Unlabeled Directed Please check one: Single $85 Double $95 Arrival Graphs: Michael A. Bender, Donna K. Slonim. Date: Departure Date: Please fill out: Name 9:009:259:5010:15Break: 10:40 am { 11:10 am Address Fax: Phone Sharing room with If paying for deposit by credit card please complete: Plenary session I: 11:10 { 12:10 Chair: M. Yannakakis Credit Card Type Credit Card Number Expiration Date I authorize Eldorado Algorithmic Number Theory - Hotel to charge the above account for the amount equal The Complexity Contribution to one night's stay as deposit. Signature Leonard Adelmann , USC Lunch: 12:10 am { 1:45 pm Sunday Session 2a { chair V. Shoup On the Power of Quantum Computation: Daniel MONDAY, NOVEMBER 21, 1994 R. Simon. Algorithms for Quantum Computa- tion: Discrete Log and Factoring: Peter W. Shor. The Complexity of the A B C Problem Resolved: Monday Session 1a { chair J. Hastad Jin-Yi Cai, Richard J. Lipton, Yechezkel Zalc- stein. Efficient Average-Case Algorithms for the A Lower Bound for the Monotone Depth of Con- Modular Group: Jin-Yi Cai, W.H.J. Fuchs, Dex- nectivity: Andrew Chi-Chi Yao. Efficient Obliv- ter Kozen, Zicheng Liu. ious Branching Programs for Threshold Func- tions: Rakesh Kumar Sinha, Jayram Thathachar. Products and Help Bits in Decision Trees: Noam Nisan, Steven Rudich, Michael Saks. On Rank 1:452:102:353:00Sunday Session 2b { chair E. Tardos vs. Communication Complexity: Noam Nisan, Avi Widgerson. Finding the k Shortest Paths: David Epp- stein. Long Tours and Short Superstrings: S. Rao Kosaraju, James K. Park, Clifford 9:009:259:5010:15Tuesday Session 1b { chair S. Rao Stein. Maximum (s,t)-Flows in Planar Networks O(jV j log jV j): Karsten Weihe. Estimating the On the Design of Reliable Boolean Circuits Size of the Transitive Closure in Linear Expected that Contain Partially-Unreliable Gates: Dan Time: Edith Cohen. Kleitman, Tom Leighton, Yuan Ma. Nearly Tight Bounds for Wormhole Routing: Abhiram G. Ranade, Saul Schleimer, Daniel Wiklerson. Scheduling Multithreaded Computations by Work 1:452:102:353:00Break: 3:25 pm { 3:45 pm Stealing: Robert D. Blumofe, Charles E. Leis- erson. Fast and Feasible Periodic Sorting Net- works of Constant Depth: Miroslaw Kutylowski, Sunday Session 3a { chair F. Meyer auf der Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Heide Wanka. Rapid Rumor Ramification: Approximating the Minimum Broadcast Time: R. Ravi. The Load, Capacity and Availability of Quorum Systems: 9:009:259:5010:15Break: 10:40 am { 11:10am Moni Naor, Avishai Wool. Fast and Lean Self- Stabilizing Asynchronous Protocols: Gene Itkis, Plenary session II: 11:10 { 12:10 Leonid Levin. Local Optimization of Global Ob- Chair: S. Goldwasser jectives: Competitive Distributed Deadlock Res- olution and Resource Allocation: Baruch Awer- Result Checking: A Theory of Test- buch, Yossi Azar. ing Meets A Test of Theory Manuel Blum , UC Berkeley 3:454:104:355:00Sunday Session 3b { chair A. Condon (De)randomized Construction of Small Sample Spaces in NC: David R. Karger, Daphne Koller. Lunch: 12:10 pm { 1:45 pm Computing with Very Weak Random Sources: Aravind Srinivasan. David Zuckerman. A New Technique for Sampling with Low Ran- Monday Session 2a { chair H. Karloff domness: M. Bellare, J. Rompel. Robust Functional Equations with Applications to Self- Beyond Competitive Analysis: Elias Koutsoupias, testing/Correcting: Ronitt Rubinfeld. Christos H. Papadimitriou. A Theory of Compet- itive Analysis for Distributed Algorithms: Mik- 3:454:104:355:005:25End of technical sessions los Ajtai. James Aspnes. Cynthia Dwork, Orli 9:00 Business Meeting Waarts. On-line Admission Control and Cir- cuit Routing for High Performance Computing and Communication: Baruch Awerbuch, Rainer Tuesday Session 1a { chair L. Lovasz Gawlick, Tom Leighton, Yuval Rabani. IP Over Connection-Oriented Networks and Distri- Expander Codes: Michael Sipser, Daniel A. Spiel- butional Paging: Carsten Lund, Steven Phillips, man. The Geometry of Graphs and Some Algo- Nick Reingold. rithmic Applications: Nathan Linial, Eran Lon- don, Yuri Rabinovich. Tail Bounds for Oc- 1:452:102:353:00Monday Session 2b { chair O. Goldreich cupancy and the Satisfiability Threshold Conjec- ture: Anil Kamath, Rajeev Motwani, Krishna Computationally-Sound Proofs: Silvio Micali. Palem, Paul Spirakis. Priority Encoding Trans- On Monotone Formula Closure of SZK: Alfredo mission: Andres Albanese, Johannes Blomer, Jeff De Santis, Giovanni Di Crescenzo, Giuseppe Edmonds, Michael Luby, Madhu Sudan. Persiano, Moti Yung. On the Complexity of Bounded-Interaction and Noninteractive Zero- 9:009:259:5010:15Tuesday Session 1b { chair M. Vardi Knowledge Proofs: Joe Kilian. Reducibility and Completeness In Multi-Party Private Computa- Graph Connectivity and Monadic NP: Thomas tions: Eyal Kushilevitz, Silvio Micali, Rafail Os- Schwentick. A Polynomial-Time Algorithm for trovsky. Deciding Equivalence of Normed Context-Free Processes: Yoram Hirshfeld, Mark Jerrum, Faron Moller. On the Combinatorial and Algebraic 1:452:102:353:00Break: 3:25 pm { 3;45 pm Complexity of Quantifier Elimination: Saugata Basu, Richard Pollack, Marie-Francoise Roy. Set Constraints with Projections are in NEXPTIME: Tuesday Session 3a { chair M. Yannakakis Witold Charatonik, Leszek Pacholski. Go With the Winners: David Aldous, Umesh Vazirani. Randomized Simplex Algorithms on 9:009:259:5010:15Break: 10:40 am { 11:10 am Klee-Minty Cubes: Bernd Gartner, Gunter M. Ziegler. Motion Planning on a Graph: Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Plenary session III: 11:10 { 12:10 Sudan, Hisao Tamaki. The Localization Problem Chair: L. Lovasz for Mobile Robots: Jon Kleinberg. Markov Chains and Polynomial Time 3:454:104:355:00Monday Session 3b { chair V. Shoup Algorithms Ravi Kannan , CMU Algebraic Computation Trees in Characteristic p > 0: Michael Ben-Or. An O(n1+) Algorithm for the Complex Roots Problem: Andrew Neff, John H. Reif. Complexity Lower Bounds for Lunch: 12:10 pm { 1:45 pm Computation Trees with Elementary Transcen- dental Function Gates: Dima Grigoriev, Nico- lai Vorobjov. On the Computation of Boolean Tuesday Session 2a { chair R. Seidel Functions by Analog Circuits of Bounded Fan-in: Gy¨orgyTur´an,Farrokh Vatan.
Load more

Recommended publications
  • Challenges in Web Search Engines
    Challenges in Web Search Engines Monika R. Henzinger Rajeev Motwani* Craig Silverstein Google Inc. Department of Computer Science Google Inc. 2400 Bayshore Parkway Stanford University 2400 Bayshore Parkway Mountain View, CA 94043 Stanford, CA 94305 Mountain View, CA 94043 [email protected] [email protected] [email protected] Abstract or a combination thereof. There are web ranking optimiza• tion services which, for a fee, claim to place a given web site This article presents a high-level discussion of highly on a given search engine. some problems that are unique to web search en• Unfortunately, spamming has become so prevalent that ev• gines. The goal is to raise awareness and stimulate ery commercial search engine has had to take measures to research in these areas. identify and remove spam. Without such measures, the qual• ity of the rankings suffers severely. Traditional research in information retrieval has not had to 1 Introduction deal with this problem of "malicious" content in the corpora. Quite certainly, this problem is not present in the benchmark Web search engines are faced with a number of difficult prob• document collections used by researchers in the past; indeed, lems in maintaining or enhancing the quality of their perfor• those collections consist exclusively of high-quality content mance. These problems are either unique to this domain, or such as newspaper or scientific articles. Similarly, the spam novel variants of problems that have been studied in the liter• problem is not present in the context of intranets, the web that ature. Our goal in writing this article is to raise awareness of exists within a corporation.
    [Show full text]
  • Adaptive Garbled RAM from Laconic Oblivious Transfer
    Adaptive Garbled RAM from Laconic Oblivious Transfer Sanjam Garg?1, Rafail Ostrovsky??2, and Akshayaram Srinivasan1 1 University of California, Berkeley fsanjamg,[email protected] 2 UCLA [email protected] Abstract. We give a construction of an adaptive garbled RAM scheme. In the adaptive setting, a client first garbles a \large" persistent database which is stored on a server. Next, the client can provide garbling of mul- tiple adaptively and adversarially chosen RAM programs that execute and modify the stored database arbitrarily. The garbled database and the garbled program should reveal nothing more than the running time and the output of the computation. Furthermore, the sizes of the garbled database and the garbled program grow only linearly in the size of the database and the running time of the executed program respectively (up to poly logarithmic factors). The security of our construction is based on the assumption that laconic oblivious transfer (Cho et al., CRYPTO 2017) exists. Previously, such adaptive garbled RAM constructions were only known using indistinguishability obfuscation or in random oracle model. As an additional application, we note that this work yields the first constant round secure computation protocol for persistent RAM pro- grams in the malicious setting from standard assumptions. Prior works did not support persistence in the malicious setting. 1 Introduction Over the years, garbling methods [Yao86,LP09,AIK04,BHR12b,App17] have been extremely influential and have engendered an enormous number of applications ? Research supported in part from DARPA/ARL SAFEWARE Award W911NF15C0210, AFOSR Award FA9550-15-1-0274, AFOSR YIP Award, DARPA and SPAWAR under contract N66001-15-C-4065, a Hellman Award and research grants by the Okawa Foundation, Visa Inc., and Center for Long-Term Cybersecurity (CLTC, UC Berkeley).
    [Show full text]
  • Stanford University's Economic Impact Via Innovation and Entrepreneurship
    Full text available at: http://dx.doi.org/10.1561/0300000074 Impact: Stanford University’s Economic Impact via Innovation and Entrepreneurship Charles E. Eesley Associate Professor in Management Science & Engineering W.M. Keck Foundation Faculty Scholar, School of Engineering Stanford University William F. Miller† Herbert Hoover Professor of Public and Private Management Emeritus Professor of Computer Science Emeritus and former Provost Stanford University and Faculty Co-director, SPRIE Boston — Delft Full text available at: http://dx.doi.org/10.1561/0300000074 Contents 1 Executive Summary2 1.1 Regional and Local Impact................. 3 1.2 Stanford’s Approach ..................... 4 1.3 Nonprofits and Social Innovation .............. 8 1.4 Alumni Founders and Leaders ................ 9 2 Creating an Entrepreneurial Ecosystem 12 2.1 History of Stanford and Silicon Valley ........... 12 3 Analyzing Stanford’s Entrepreneurial Footprint 17 3.1 Case Study: Google Inc., the Global Reach of One Stanford Startup ............................ 20 3.2 The Types of Companies Stanford Graduates Create .... 22 3.3 The BASES Study ...................... 30 4 Funding Startup Businesses 33 4.1 Study of Investors ...................... 38 4.2 Alumni Initiatives: Stanford Angels & Entrepreneurs Alumni Group ............................ 44 4.3 Case Example: Clint Korver ................. 44 5 How Stanford’s Academic Experience Creates Entrepreneurs 46 Full text available at: http://dx.doi.org/10.1561/0300000074 6 Changing Patterns in Entrepreneurial Career Paths 52 7 Social Innovation, Non-Profits, and Social Entrepreneurs 57 7.1 Case Example: Eric Krock .................. 58 7.2 Stanford Centers and Programs for Social Entrepreneurs . 59 7.3 Case Example: Miriam Rivera ................ 61 7.4 Creating Non-Profit Organizations ............. 63 8 The Lean Startup 68 9 How Stanford Supports Entrepreneurship—Programs, Cen- ters, Projects 77 9.1 Stanford Technology Ventures Program .........
    [Show full text]
  • SIGMOD Flyer
    DATES: Research paper SIGMOD 2006 abstracts Nov. 15, 2005 Research papers, 25th ACM SIGMOD International Conference on demonstrations, Management of Data industrial talks, tutorials, panels Nov. 29, 2005 June 26- June 29, 2006 Author Notification Feb. 24, 2006 Chicago, USA The annual ACM SIGMOD conference is a leading international forum for database researchers, developers, and users to explore cutting-edge ideas and results, and to exchange techniques, tools, and experiences. We invite the submission of original research contributions as well as proposals for demonstrations, tutorials, industrial presentations, and panels. We encourage submissions relating to all aspects of data management defined broadly and particularly ORGANIZERS: encourage work that represent deep technical insights or present new abstractions and novel approaches to problems of significance. We especially welcome submissions that help identify and solve data management systems issues by General Chair leveraging knowledge of applications and related areas, such as information retrieval and search, operating systems & Clement Yu, U. of Illinois storage technologies, and web services. Areas of interest include but are not limited to: at Chicago • Benchmarking and performance evaluation Vice Gen. Chair • Data cleaning and integration Peter Scheuermann, Northwestern Univ. • Database monitoring and tuning PC Chair • Data privacy and security Surajit Chaudhuri, • Data warehousing and decision-support systems Microsoft Research • Embedded, sensor, mobile databases and applications Demo. Chair Anastassia Ailamaki, CMU • Managing uncertain and imprecise information Industrial PC Chair • Peer-to-peer data management Alon Halevy, U. of • Personalized information systems Washington, Seattle • Query processing and optimization Panels Chair Christian S. Jensen, • Replication, caching, and publish-subscribe systems Aalborg University • Text search and database querying Tutorials Chair • Semi-structured data David DeWitt, U.
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Securely Obfuscating Re-Encryption
    Securely Obfuscating Re-Encryption Susan Hohenberger¤ Guy N. Rothblumy abhi shelatz Vinod Vaikuntanathanx December 1, 2008 Abstract We present a positive obfuscation result for a traditional cryptographic functionality. This posi- tive result stands in contrast to well-known impossibility results [3] for general obfuscation and recent impossibility and improbability [13] results for obfuscation of many cryptographic functionalities. Whereas other positive obfuscation results in the standard model apply to very simple point func- tions, our obfuscation result applies to the signi¯cantly more complex and widely-used re-encryption functionality. This functionality takes a ciphertext for message m encrypted under Alice's public key and transforms it into a ciphertext for the same message m under Bob's public key. To overcome impossibility results and to make our results meaningful for cryptographic functionalities, our scheme satis¯es a de¯nition of obfuscation which incorporates more security-aware provisions. ¤Johns Hopkins University, [email protected]. Research partially performed at IBM Zurich Research Laboratory, Switzer- land. yMIT CSAIL, [email protected]. Research supported by NSF grant CNS-0430450 and NSF grant CFF-0635297. zUniversity of Virginia, [email protected]. Research performed at IBM Zurich Research Laboratory, Switzerland. xMIT CSAIL, [email protected] 1 1 Introduction A recent line of research in theoretical cryptography aims to understand whether it is possible to obfuscate programs so that a program's code becomes unintelligible while its functionality remains unchanged. A general method for obfuscating programs would lead to the solution of many open problems in cryptography. Unfortunately, Barak, Goldreich, Impagliazzo, Rudich, Sahai, Vadhan and Yang [3] show that for many notions of obfuscation, a general program obfuscator does not exist|i.e., they exhibit a class of circuits which cannot be obfuscated.
    [Show full text]
  • Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds
    comput. complex. c Springer Nature Switzerland AG 2019 DOI 10.1007/s00037-019-00177-4 computational complexity PREDICTION FROM PARTIAL INFORMATION AND HINDSIGHT, WITH APPLICATION TO CIRCUIT LOWER BOUNDS Or Meir and Avi Wigderson Abstract. Consider a random sequence of n bits that has entropy at least n − k, where k n. A commonly used observation is that an average coordinate of this random sequence is close to being uniformly distributed, that is, the coordinate “looks random.” In this work, we prove a stronger result that says, roughly, that the average coordinate n looks random to an adversary that is allowed to query ≈ k other co- ordinates of the sequence, even if the adversary is non-deterministic. This implies corresponding results for decision trees and certificates for Boolean functions. As an application of this result, we prove a new result on depth-3 cir- cuits, which recovers as a direct corollary the known lower bounds for the parity and majority functions, as well as a lower bound on sensi- tive functions due to Boppana (Circuits Inf Process Lett 63(5):257–261, 1997). An interesting feature of this proof is that it works in the frame- work of Karchmer and Wigderson (SIAM J Discrete Math 3(2):255–265, 1990), and, in particular, it is a “top-down” proof (H˚astad et al. in Computat Complex 5(2):99–112, 1995). Finally, it yields a new kind of a random restriction lemma for non-product distributions, which may be of independent interest. Keywords. Certificate complexity, Circuit complexity, Circuit com- plexity lower bounds, Decision tree complexity, Information theoretic, Query complexity, Sensitivity Subject classification.
    [Show full text]
  • Statistical Queries and Statistical Algorithms: Foundations and Applications∗
    Statistical Queries and Statistical Algorithms: Foundations and Applications∗ Lev Reyzin Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago [email protected] Abstract We give a survey of the foundations of statistical queries and their many applications to other areas. We introduce the model, give the main definitions, and we explore the fundamental theory statistical queries and how how it connects to various notions of learnability. We also give a detailed summary of some of the applications of statistical queries to other areas, including to optimization, to evolvability, and to differential privacy. 1 Introduction Over 20 years ago, Kearns [1998] introduced statistical queries as a framework for designing machine learning algorithms that are tolerant to noise. The statistical query model restricts a learning algorithm to ask certain types of queries to an oracle that responds with approximately correct answers. This framework has has proven useful, not only for designing noise-tolerant algorithms, but also for its connections to other noise models, for its ability to capture many of our current techniques, and for its explanatory power about the hardness of many important problems. Researchers have also found many connections between statistical queries and a variety of modern topics, including to evolvability, differential privacy, and adaptive data analysis. Statistical queries are now both an important tool and remain a foundational topic with many important questions. The aim of this survey is to illustrate these connections and bring researchers to the forefront of our understanding of this important area. We begin by formally introducing the model and giving the main definitions (Section 2), we then move to exploring the fundamental theory of learning statistical queries and how how it connects to other notions of arXiv:2004.00557v2 [cs.LG] 14 May 2020 learnability (Section 3).
    [Show full text]
  • Practical Considerations in Benchmarking Digital Testing Systems
    Foreword The papers in these proceedings were presented at the 39th Annual Symposium on Foundations of Computer Science (FOCS ‘98), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing. The conference was held in Palo Alto, California, November g-11,1998. The program committee consisted of Miklos Ajtai (IBM Almaden), Mihir Bellare (UC San Diego), Allan Borodin (Toronto), Edith Cohen (AT&T Labs), Sally Goldman (Washington), David Karger (MIT), Jon Kleinberg (Cornell), Rajeev Motwani (chair, Stanford)), Seffi Naor (Technion), Christos Papadimitriou (Berkeley), Toni Pitassi (Arizona), Dan Spielman (MIT), Eli Upfal (Brown), Emo Welzl (ETH Zurich), David Williamson (IBM TJ Watson), and Frances Yao (Xerox PARC). The program committee met on June 26-28, 1998, and selected 76 papers from the 204 detailed abstracts submitted. The submissions were not refereed, and many of them represent reports of continuing research. It is expected that most of these papers will appear in a more complete and polished form in scientific journals in the future. The program committee selected two papers to jointly receive the Machtey Award for the best student-authored paper. These two papers were: “A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem” by Kamal Jain, and “The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant” by Daniele Micciancio. There were many excellent candidates for this award, each one deserving. At this conference we organized, for the first time, a set of three tutorials: “Geometric Computation and the Art of Sampling” by Jiri Matousek; “Theoretical Issues in Probabilistic Artificial Intelligence” by Michael Kearns; and, “Information Retrieval on the Web” by Andrei Broder and Monika Henzinger.
    [Show full text]
  • The Pagerank Citation Ranking: Bringing Order to the Web
    The PageRank Citation Ranking: Bringing Order to the Web Marlon Dias [email protected] Information Retrieval DCC/UFMG - 2017 Introduction Paper: The PageRank Citation Ranking: Bringing Order to the Web, 1999 Authors: Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd Page and Brin were MS students at Stanford They founded Google in September, 98. Most of this presentation is based on the original paper (link) The Initiative's focus is to dramatically “ advance the means to collect, store, and organize information in digital forms, and make it available for searching, retrieval, and processing via communication networks -- all in user-friendly ways. Stanford WebBase project Pagerank Motivation ▪ Web is vastly large and heterogeneous ▫ Original paper's estimation were over 150 M pages and 1.7 billion of links ▪ Pages are extremely diverse ▫ Ranging from "What does the fox say? " to journals about IR ▪ Web Page present some "structure" ▫ Pagerank takes advantage of links structure Pagerank Motivation ▪ Inspiration: Academic citation ▪ Papers ▫ are well defined units of work ▫ are roughly similar in quality ▫ are used to extend the body of knowledge ▫ can have their "quality" measured in number of citations Pagerank Motivation ▪ Web pages, on the other hand ▫ proliferate free of quality control or publishing costs ▫ huge numbers of pages can be created easily ▸ artificially inflating citation counts ▫ They vary on much wider scale than academic papers in quality, usage, citations and length Pagerank Motivation A research article A random archived about the effects of message posting cellphone use on asking an obscure driver attention is very question about an IBM different from an computer is very advertisement for a different from the IBM particular cellular home page provider The average web page quality experienced “ by a user is higher than the quality of the average web page.
    [Show full text]
  • The Pagerank Citation Ranking: Bringing Order to the Web Paper Review
    The PageRank Citation Ranking: Bringing Order to the Web Paper Review Anand Singh Kunwar 1 Introduction The PageRank [1] algorithm decribes a way to compute ranks or ratings of web pages. This comes from a simple intuition. Consider the web to be a directed graph with each node being a web page. Each web page has certain links to it and certain links from it. Let these links be edges of our directed graph. Something like what we can see in the following graphical representation of 3 pages. a c b The pages a, b and c have some outgoing and incoming edges. We compute the total PageRank of these pages by iterating over the following algorithm. X Rank(v) Rank(u) = c + cE(u) Nv v2Lu Here Nv are number of pages being linked by v, Lu is the set of pages which have links to u, E(u) is some vector that correspond to the source of rank and c is the normalising constant. The reason why the E(u) was introduced was for cases when a loop has no out-edges. In this case, our ranks of nodes inside this loop would blow up. The paper also provides us with a real life intuition for this. Authors provide us with a random surfer model. This model states that a web surfer will click consecutive pages like a random walk on graphs. However, in case this surfer encounters a loop of webpages with no other outgoing webpage than the ones in the loop, it is highly unlikely that this surfer will continue.
    [Show full text]
  • David Karger Rajeev Motwani Y Madhu Sudan Z
    Approximate Graph Coloring by Semidenite Programming y z David Karger Rajeev Motwani Madhu Sudan Abstract We consider the problem of coloring k colorable graphs with the fewest p ossible colors We present a randomized p olynomial time algorithm which colors a colorable graph on n vertices 12 12 13 14 with minfO log log n O n log ng colors where is the maximum degree of any vertex Besides giving the b est known approximation ratio in terms of n this marks the rst nontrivial approximation result as a function of the maximum degree This result can 12 12k b e generalized to k colorable graphs to obtain a coloring using minfO log log n 12 13(k +1) O n log ng colors Our results are inspired by the recent work of Go emans and Williamson who used an algorithm for semidenite optimization problems which generalize lin ear programs to obtain improved approximations for the MAX CUT and MAX SAT problems An intriguing outcome of our work is a duality relationship established b etween the value of the optimum solution to our semidenite program and the Lovasz function We show lower b ounds on the gap b etween the optimum solution of our semidenite program and the actual chromatic numb er by duality this also demonstrates interesting new facts ab out the function MIT Lab oratory for Computer Science Cambridge MA Email kargermitedu URL httptheorylcsmitedukarger Supp orted by a Hertz Foundation Graduate Fellowship by NSF Young In vestigator Award CCR with matching funds from IBM Schlumb erger Foundation Shell Foundation and Xerox Corp oration
    [Show full text]