Babai

Results: 30



#Item
1

3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen

Add to Reading List

Source URL: www.graphs.ee

Language: English - Date: 2014-10-29 13:30:24
    2

    List of publications in reverse chronological order with clickable links L´aszl´o Babai April 11, 2014

    Add to Reading List

    Source URL: people.cs.uchicago.edu

    - Date: 2014-04-11 22:55:39
      3

      List of my favorite publications in order of my personal preference with clickable links L´aszl´o Babai April 11, 2014

      Add to Reading List

      Source URL: people.cs.uchicago.edu

      - Date: 2014-04-11 23:02:29
        4

        Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015

        Add to Reading List

        Source URL: arxiv.org

        - Date: 2015-12-13 20:28:33
          5Theoretical computer science / Lance Fortnow / Probabilistic complexity theory / Carsten Lund / Computer science / IP / BPP / Probabilistically checkable proof / Symposium on Foundations of Computer Science / Mathematics

          Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 08:04:57
          6Babai / Symposium on Foundations of Computer Science

          Codes April 12, Sanjeev Arora, L´ aszl´ o Babai, Jacques Stern, and Z. (Elizabeth) Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 03:21:38
          7Communication / Communication complexity / Computational complexity theory / Quantum complexity theory / Quantum information science

          Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 03:40:34
          8Computational complexity theory / Module:User:Lesser Cartographies/MR / Lszl Babai

          Book, chapter of book, survey articles April 12, L´ aszl´ o Babai and P´eter Frankl. Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science. Univ. of Chicago Dept. Compu

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 05:16:42
          9Mathematics / Combinatorica / Notices of the American Mathematical Society / Tibor Gallai / Babai / Science and technology / Module:User:Lesser Cartographies/MR

          Biographic articles and obituaries: Paul Erd˝os, Tibor GallaiL´ aszl´ o Babai. Paul Erd˝os just left town. Notices Amer. Math. Soc., 45 (1):66–73, JanuaryURL http://www.ams.org/notices/

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 01:18:10
          10Finite groups / Mathematics / Permutation group / IP / Module:User:Lesser Cartographies/MR

          Papers in pure mathematics motivated by and affecting the theory of computing April 12, L´ aszl´ o Babai. On the order of uniprimitive permutation groups. Ann.

          Add to Reading List

          Source URL: people.cs.uchicago.edu

          Language: English - Date: 2014-04-12 03:01:32
          UPDATE