DOCSLIB.ORG

Ieee Catalog No. 75 Ch 1003-3C

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Ieee Catalog No. 75 Ch 1003-3C IEEE CATALOG NO. 75 CH 1003-3C Copies available frorTl: lEE E Computer Society 5855 Naples Plaza, Suite 301 Long Beach, California 90803 lEE E, Order Department 345 East 47th Street New York, New York 10017 Copyright 1975 by The Insti tute of EIectricaI and Electrof1ics Engl IH-;ers, I r 1C. 16th Annual Symposium on Foundations of Computer Science (Formerly called the Annual Symposium on S'witching and Automata Theory) sponsored by IEEE Conlputer Society Technical COllllllittl'l' on f'v1athelllatical Foundations of COlllputing in co()peration with thl' ACM Special Interest Group for Autolllata and COlllputability Theory and the DepartInent of Electrical Engineering and Conlputer Sciences, The University of California, Berkeley ~. {\ - •. 1- . __ 1'"} 1 Cl{)'"7C A. _ . _. ._ Ieee Computer :::ioclety ~ "-.)LllJl'L·1 1 ,1-1 ,', 17/ ,I <.~ Institute ot clectrlCJI Jncl electronics engineers y® Additional copies available from: I EEE Computer Society IEEE 5855 Naples Plaza 445 Hoes Lane Long Beach, CA 90803 Piscataway, NJ 08854 IEEE 75 CH 1003-3C Copyright ©1975 by the Institute of Electrical and Electronics Engineers, Inc. 1975 SIXTEENTH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE OCTOBER 13-15, 1975 TABLE OF CONTENTS Monday, October 13 Session I: Ian Munro, Chairman The Effect of the Field of Constants on the Number of Multiplications by Shmuel Winograd . 1 The Exact Time Required to Perform Generalized Addition by Robert W. Floyd . 3 Polynomials with 0-1 Coefficients that are Hard to Evaluate by Richard J. Lipton . 6 Fast Parallel Matrix Inversion Algorithms by L. Csanky . 11 Parallel Computations in Graph Theory by Eshrat Arjomandi and D. G. Corneil 13 Synchronization and Computing Capabilities of Linear Asynchronous Structures by R. J. Lipton, R. E. Miller and L. Snyder................. 19 Session II: Robert L. Constable, Chairman Flow of Control in the Proof Theory of Structured Programming by J. W. de Bakker 29 Bases for Chain-Complete Posets by George Markowsky and Barry K. Rosen................. 34 Correct Computation Rules for Recursive Languages by Peter J. Downey and Ravi Sethi 48 On Time Versus Space and Related Problems by John Hopcroft, Wolfgang Paul and Leslie Valiant 57 A Note on Tape Bounds for sla Language Processing by J. Hartmanis and L. Berman 65 (iv) Tuesday, October 14 Session III: Patrick C. Fischer, Chairman Minimean Optimality in Sorting Algorithms by Ira Pohl 71 Preserving Order in a Forest in Less Than Logarithmic Time by P. van Emde Boas 75 On the Complexity of Comparison Problems Using Linear Functions by Andew Chi-Chih Yao 85 Evaluating Relational Expressions with Dense and Sparse Arguments by T. G. Szymanski and J. D. Ullman 90 On the Decision Tree Complexity of the Shortest Path Problems by Michael L. Fredman 98 2 5 An 0(n . ) Algorithm for Maximum Matching in General Graphs by S. Even and O. Kariv ~ ................................ .. 100 Session IV: Sheldon B. Akers, Chairman Information Theory and the Complexity of Switching Networks by Nicholas Pippenger 113 The Effect of Basis on Size of Boolean Expressions by V. R. Pratt 119 Economy of Description by Parsers, DPDA's, and PDA's by Matthew M.Geller, Harry B. Hunt III, Thomas G. Szymanski and Jeffrey D. Ullman .. 122 An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata by C. Beeri 128 A Grammatical Characterization of Exponential-Time Languages by William C. Rounds 135 Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages by H. B. Hunt III and J. L. Rangel 144 Wednesday, October 15 Session V: Alfred V. Aho, Chairman Closest-Point Problems by Michael Ian Shamos and Dan Hoey 151 An Optimal Bound for Two Dimensional Bin Packing by Daniel J. Kleitman and Michael M. Krieger...................................... 163 Computational Complexity of Decision Procedures for Polynomials by Leonard Adleman and Kenneth Manders 169 An Application of Graph Coloring to Printed Circuit Testing by M. R. Garey, D. S. Johnson and H. C. So 178 On the Complexity of Timetable and Multi-Commodity Flow Problems by S. Even, A. Itai and A. Shamir . 184 (v).
Load more

Recommended publications
  • Efficient Algorithms with Asymmetric Read and Write Costs
    Efficient Algorithms with Asymmetric Read and Write Costs Guy E. Blelloch1, Jeremy T. Fineman2, Phillip B. Gibbons1, Yan Gu1, and Julian Shun3 1 Carnegie Mellon University 2 Georgetown University 3 University of California, Berkeley Abstract In several emerging technologies for computer memory (main memory), the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs poses a fun- damentally different model from the RAM for algorithm design. In this paper we study lower and upper bounds for various problems under such asymmetric read and write costs. We con- sider both the case in which all but O(1) memory has asymmetric cost, and the case of a small cache of symmetric memory. We model both cases using the (M, ω)-ARAM, in which there is a small (symmetric) memory of size M and a large unbounded (asymmetric) memory, both random access, and where reading from the large memory has unit cost, but writing has cost ω 1. For FFT and sorting networks we show a lower bound cost of Ω(ωn logωM n), which indicates that it is not possible to achieve asymptotic improvements with cheaper reads when ω is bounded by a polynomial in M. Moreover, there is an asymptotic gap (of min(ω, log n)/ log(ωM)) between the cost of sorting networks and comparison sorting in the model. This contrasts with the RAM, and most other models, in which the asymptotic costs are the same. We also show a lower bound for computations on an n × n diamond DAG of Ω(ωn2/M) cost, which indicates no asymptotic improvement is achievable with fast reads.
    [Show full text]
  • Computational Learning Theory: New Models and Algorithms
    Computational Learning Theory: New Models and Algorithms by Robert Hal Sloan S.M. EECS, Massachusetts Institute of Technology (1986) B.S. Mathematics, Yale University (1983) Submitted to the Department- of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 1989 @ Robert Hal Sloan, 1989. All rights reserved The author hereby grants to MIT permission to reproduce and to distribute copies of this thesis document in whole or in part. Signature of Author Department of Electrical Engineering and Computer Science May 23, 1989 Certified by Ronald L. Rivest Professor of Computer Science Thesis Supervisor Accepted by Arthur C. Smith Chairman, Departmental Committee on Graduate Students Abstract In the past several years, there has been a surge of interest in computational learning theory-the formal (as opposed to empirical) study of learning algorithms. One major cause for this interest was the model of probably approximately correct learning, or pac learning, introduced by Valiant in 1984. This thesis begins by presenting a new learning algorithm for a particular problem within that model: learning submodules of the free Z-module Zk. We prove that this algorithm achieves probable approximate correctness, and indeed, that it is within a log log factor of optimal in a related, but more stringent model of learning, on-line mistake bounded learning. We then proceed to examine the influence of noisy data on pac learning algorithms in general. Previously it has been shown that it is possible to tolerate large amounts of random classification noise, but only a very small amount of a very malicious sort of noise.
    [Show full text]
  • Four Results of Jon Kleinberg a Talk for St.Petersburg Mathematical Society
    Four Results of Jon Kleinberg A Talk for St.Petersburg Mathematical Society Yury Lifshits Steklov Institute of Mathematics at St.Petersburg May 2007 1 / 43 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 / 43 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 2 / 43 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 2 / 43 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 2 / 43 Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams 2 / 43 Part I History of Nevanlinna Prize Career of Jon Kleinberg 3 / 43 Nevanlinna Prize The Rolf Nevanlinna Prize is awarded once every 4 years at the International Congress of Mathematicians, for outstanding contributions in Mathematical Aspects of Information Sciences including: 1 All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.
    [Show full text]
  • Navigability of Small World Networks
    Navigability of Small World Networks Pierre Fraigniaud CNRS and University Paris Sud http://www.lri.fr/~pierre Introduction Interaction Networks • Communication networks – Internet – Ad hoc and sensor networks • Societal networks – The Web – P2P networks (the unstructured ones) • Social network – Acquaintance – Mail exchanges • Biology (Interactome network), linguistics, etc. Dec. 19, 2006 HiPC'06 3 Common statistical properties • Low density • “Small world” properties: – Average distance between two nodes is small, typically O(log n) – The probability p that two distinct neighbors u1 and u2 of a same node v are neighbors is large. p = clustering coefficient • “Scale free” properties: – Heavy tailed probability distributions (e.g., of the degrees) Dec. 19, 2006 HiPC'06 4 Gaussian vs. Heavy tail Example : human sizes Example : salaries µ Dec. 19, 2006 HiPC'06 5 Power law loglog ppk prob{prob{ X=kX=k }} ≈≈ kk-α loglog kk Dec. 19, 2006 HiPC'06 6 Random graphs vs. Interaction networks • Random graphs: prob{e exists} ≈ log(n)/n – low clustering coefficient – Gaussian distribution of the degrees • Interaction networks – High clustering coefficient – Heavy tailed distribution of the degrees Dec. 19, 2006 HiPC'06 7 New problematic • Why these networks share these properties? • What model for – Performance analysis of these networks – Algorithm design for these networks • Impact of the measures? • This lecture addresses navigability Dec. 19, 2006 HiPC'06 8 Navigability Milgram Experiment • Source person s (e.g., in Wichita) • Target person t (e.g., in Cambridge) – Name, professional occupation, city of living, etc. • Letter transmitted via a chain of individuals related on a personal basis • Result: “six degrees of separation” Dec.
    [Show full text]
  • A Memorable Trip Abhisekh Sankaran Research Scholar, IIT Bombay
    A Memorable Trip Abhisekh Sankaran Research Scholar, IIT Bombay It was my first trip to the US. It had not yet sunk in that I had been chosen by ACM India as one of two Ph.D. students from India to attend the big ACM Turing Centenary Celebration in San Francisco until I saw the familiar face of Stephen Cook enter a room in the hotel a short distance from mine; later, Moshe Vardi recognized me from his trip to IITB during FSTTCS, 2011. I recognized Nitin Saurabh from IMSc Chennai, the other student chosen by ACM-India; 11 ACM SIG©s had sponsored students and there were about 75 from all over the world. Registration started at 8am on 15th June, along with breakfast. Collecting my ©Student Scholar© badge and stuffing in some food, I entered a large hall with several hundred seats, a brightly lit podium with a large screen in the middle flanked by two others. The program began with a video giving a brief biography of Alan Turing from his boyhood to the dynamic young man who was to change the world forever. There were inaugural speeches by John White, CEO of ACM, and Vint Cerf, the 2004 Turing Award winner and incoming ACM President. The MC for the event, Paul Saffo, took over and the panel discussions and speeches commenced. A live Twitter feed made it possible for people in the audience and elsewhere to post questions/comments which were actually taken up in the discussions. Of the many sessions that took place in the next two days, I will describe three that I found most interesting.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • School of Computer Science
    MANCHESTER 1824 School of Computer Science Weekly Newsletter 20 February 2012 Contents News from Head of School News from HoS Royal Visit This Week Prince Andrew visited the School on Tuesday 14th February. Prince Andrew was School Events given a tour of the graphene laboratories by Andre Geim, and made a sample of graphene himself, which he viewed under the microscope. External Events Members of the graphene research team told the Prince about future Funding Opps applications of graphene, which is the world’s thinnest, strongest and most conductive material. Prize & Award Opps http://www.manchester.ac.uk/aboutus/news/display/?id=7977 Research Awards The visit in connection with the announcement of the new £45M graphene building: Staff News http://www.manchester.ac.uk/aboutus/news/display/?id=7930 Vacancies Turing Centenary Conference Andrei Voronkov has announced the Turing Centenary Conference, to be held in Links Manchester, June 22-25, 2012: http://www.turing100.manchester.ac.uk/ News Submissions Andrei has secured Ten Turing Award winners, a Templeton Award winner and Newsletter Archive Garry Kasparov as invited speakers: School Strategy Confirmed invited speakers: School Intranet - Fred Brooks (University of North Carolina) - Rodney Brooks (MIT) School Seminars - Vint Cerf (Google) ESNW Seminars - Ed Clarke (Carnegie Mellon University) NaCTeM Seminars - Jack Copeland (University of Canterbury, New Zealand) - George Francis Rayner Ellis (University of Cape Town) - David Ferrucci (IBM) - Tony Hoare (Microsoft Research) - Garry Kasparov (Kasparov Chess Foundation) - Don Knuth (Stanford University) - Yuri Matiyasevich (Institute of Mathematics, St. Petersburg) - Roger Penrose (Oxford) - Adi Shamir (Weizmann Institute of Science) - Michael Rabin (Harvard) - Leslie Valiant (Harvard) - Manuela M.
    [Show full text]
  • Kronecker Products, Low-Depth Circuits, and Matrix Rigidity
    Kronecker Products, Low-Depth Circuits, and Matrix Rigidity Josh Alman∗ February 25, 2021 Abstract For a matrix M and a positive integer r, the rank r rigidity of M is the smallest number of entries of M which one must change to make its rank at most r. There are many known applications of rigidity lower bounds to a variety of areas in complexity theory, but fewer known applications of rigidity upper bounds. In this paper, we use rigidity upper bounds to prove new upper bounds in a few different models of computation. Our results include: • For any d> 1, and over any field F, the N N Walsh-Hadamard transform has a depth-d linear circuit of size O(d N 1+0.96/d). This× circumvents a known lower bound of Ω(d N 1+1/d) for circuits with· bounded coefficients over C [Pud00], by using coefficients of· magnitude polynomial in N. Our construction also generalizes to linear transformations given by a Kronecker power of any fixed 2 2 matrix. × • The N N Walsh-Hadamard transform has a linear circuit of size (1.81+o(1))N log N, × ≤ 2 improving on the bound of 1.88N log2 N which one obtains from the standard fast Walsh-Hadamard transform. ≈ • A new rigidity upper bound, showing that the following classes of matrices are not rigid enough to prove circuit lower bounds using Valiant’s approach: n n n 2 ×2 – for any field F and any function f : 0, 1 F, the matrix Vf F given by, n { } → ∈ for any x, y 0, 1 , Vf [x, y]= f(x y), and ∈{ } ∧ q×q – for any field F and any fixed-size matrices M1,...,M F , the Kronecker product n ∈ M1 M2 M .
    [Show full text]
  • COMP 516 Research Methods in Computer Science Research Methods in Computer Science Lecture 3: Who Is Who in Computer Science Research
    COMP 516 COMP 516 Research Methods in Computer Science Research Methods in Computer Science Lecture 3: Who is Who in Computer Science Research Dominik Wojtczak Dominik Wojtczak Department of Computer Science University of Liverpool Department of Computer Science University of Liverpool 1 / 24 2 / 24 Prizes and Awards Alan M. Turing (1912-1954) Scientific achievement is often recognised by prizes and awards Conferences often give a best paper award, sometimes also a best “The father of modern computer science” student paper award In 1936 introduced Turing machines, as a thought Example: experiment about limits of mechanical computation ICALP Best Paper Prize (Track A, B, C) (Church-Turing thesis) For the best paper, as judged by the program committee Gives rise to the concept of Turing completeness and Professional organisations also give awards based on varying Turing reducibility criteria In 1939/40, Turing designed an electromechanical machine which Example: helped to break the german Enigma code British Computer Society Roger Needham Award His main contribution was an cryptanalytic machine which used Made annually for a distinguished research contribution in computer logic-based techniques science by a UK based researcher within ten years of their PhD In the 1950 paper ‘Computing machinery and intelligence’ Turing Arguably, the most prestigious award in Computer Science is the introduced an experiment, now called the Turing test A. M. Turing Award 2012 is the Alan Turing year! 3 / 24 4 / 24 Turing Award Turing Award Winners What contribution have the following people made? The A. M. Turing Award is given annually by the Association for Who among them has received the Turing Award? Computing Machinery to an individual selected for contributions of a technical nature made Frances E.
    [Show full text]
  • Brain Science and Computer Science
    Research Interfaces betweenBrain Science and Computer Science Join the conversation at #cccbrain RESEARCH INTERFACES BETWEEN BRAIN SCIENCE AND COMPUTER SCIENCE Brain Workshop Description Computer science and brain science share deep intellectual roots. Today, understanding the structure and function of the human brain is one of the greatest scientific challenges of our generation. Decades of study and continued progress in our knowledge of neural function and brain architecture have led to important advances in brain science, but a comprehensive understanding of the brain still lies well beyond the horizon. How might computer science and brain science benefit from one another? This two-day workshop, sponsored by the Computing Community Consortium (CCC) and National Science Foundation (NSF), brings together brain researchers and computer scientists for a scientific dialogue aimed at exposing new opportunities for joint research in the many exciting facets, established and new, of the interface between the two fields. Organizing Committee Polina Golland Tal Rabin Professor, Computer Science and Artificial Head of Cryptography Research Group, IBM T.J. Intelligence Laboratory, Massachusetts Watson Research Center Institute of Technology Stefan Schaal Gregory Hager Professor, Computer Science, Neuroscience, Chair of the Computer Science Department, and Biomedical Engineering, University of The Johns Hopkins University Southern California Christof Koch Joshua Tenenbaum Chief Scientific Officer, Allen Institute for Brain Professor, Brain and
    [Show full text]
  • Valiant Transcript Final with Timestamps
    A. M. Turing Award Oral History Interview with Leslie Gabriel Valiant by Michael Kearns Cambridge, Massachusetts July 25, 2017 Kearns: Good morning. My name is Michael Kearns and it is July 25th, 2017. I am here at Harvard University with Leslie Valiant, who’s sitting to my left. Leslie is a Professor of Computer Science and Applied Mathematics here at Harvard. He was also the recipient of the 2010 ACM Turing Award for his many fundamental contributions to computer science and other fields. We’re here this morning to interview Les as part of the Turing Award Winners video project, which is meant to document and record some comments from the recipients about their life and their work. So good morning, Les. Valiant: Morning, Michael. Kearns: Maybe it makes sense to start near the beginning or maybe even a little bit before. You could tell us a little bit about your upbringing or your family and your background. Valiant: Yes. My father was a chemical engineer. My mother was good at languages. She worked as a translator. I was born in Budapest in Hungary, but I was brought up in England. My schooling was split between London and the North East. As far as my parents, as far as parents, I suppose the main summary would be that they were very kind of generous and giving, that I don’t recall them ever giving me directions or even suggestions. They just let me do what I felt like doing. But I think they made it clear what they respected. Certainly they respected the intellectual life very much.
    [Show full text]
  • Speakers and Young Scientists Directory
    SINGAPORE 2016 17 - 22 JANUARY 2016 SPEAKERS AND YOUNG SCIENTISTS DIRECTORY ADVANCING SCIENCE, CREATING TECHNOLOGIES FOR A BETTER WORLD TABLE OF CONTENTS Speakers 3 Young Scientists Index 48 Young Scientists Directory 54 International Advisory Committee 145 SPEAKERS SPEAKERS SPEAKERS NOBEL PRIZE FIELDS MEDAL Prof Ada Yonath Prof Arieh Warshel Prof Cédric Villani Prof Stephen Smale Chemistry (2009) Chemistry (2013) Fields Medal (2010) Fields Medal (1966) Prof Ei-ichi Negishi Sir Anthony Leggett MILLENIUM TECHNOLOGY PRIZE Chemistry (2010) Physics (2003) Prof Michael Grätzel Prof Stuart Parkin Prof Carlo Rubbia Prof David Gross Millennium Technoly Prize (2010) Millennium Technology Award (2014) Physics (1984) Physics (2004) TURING AWARD Prof Gerard ’t Hooft Prof Jerome Friedman Physics (1999) Physics (1990) Prof Andrew Yao Dr Leslie Lamport Turing Award (2000) Turing Award (2013) Prof Serge Haroche Prof Harald zur Hausen Physics (2012) Physiology or Medicine (2008) Prof Leslie Valiant Prof Richard Karp Turing Award (2010) Turing Award (1985) Prof John Robin Warren Sir Richard Roberts Physiology or Medicine (2005) Physiology or Medicine (1993) Sir Tim Hunt Physiology or Medicine (2001) 4 5 SPEAKERS SPEAKERS When Professor Ada Yonath won the 2009 their ability to withstand high temperatures. At the time, others criticised Nobel Prize in Chemistry for her discovery of her decision to work with the little known bacteria, but the discovery the structure of ribosomes, she not only raised of heat-stable enzymes which revolutionised molecular biology soon public interest in science but also inspired a silenced them. By the early 1980s, Prof Yonath was able to create the first greater appreciation for a head of curly hair.
    [Show full text]