Paul Vitányi


Ontology type: schema:Person     


Person Info

NAME

Paul

SURNAME

Vitányi

Publications in SciGraph latest 50 shown

  • 2013-03 Tolstoy’s Mathematics in War and Peace in THE MATHEMATICAL INTELLIGENCER
  • 2011-11 Remembering Kolmogorov in METASCIENCE
  • 2009-11 Depth as Randomness Deficiency in THEORY OF COMPUTING SYSTEMS
  • 2009 Normalized Information Distance in INFORMATION THEORY AND STATISTICAL LEARNING
  • 2008 Registers in ENCYCLOPEDIA OF ALGORITHMS
  • 2007 Algorithmic Chaos and the Incompressibility Method in KOLMOGOROV’S HERITAGE IN MATHEMATICS
  • 2007 Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) in ENTROPY, SEARCH, COMPLEXITY
  • 2006-02 On the importance of having an identity or, is consensus really universal? in DISTRIBUTED COMPUTING
  • 2006 About the Lifespan of Peer to Peer Networks in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2006 Similarity of Objects and the Meaning of Words in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2005-06-21 Average-case analysis via incompressibility in FUNDAMENTALS OF COMPUTATION THEORY
  • 2005-06-16 Atomic multireader register in DISTRIBUTED ALGORITHMS
  • 2004 Individual Communication Complexity in STACS 2004
  • 2003-09 Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers in JOURNAL OF LOGIC, LANGUAGE AND INFORMATION
  • 2002-07 Randomized two-process wait-free test-and-set in DISTRIBUTED COMPUTING
  • 2002-01-18 New Applications of the Incompressibility Method (Extended Abstract) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002-01-18 Average-Case Complexity of Shellsort (Preliminary Version) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Sharpening Occam’s Razor in COMPUTING AND COMBINATORICS
  • 2002 Simple Wait-Free Multireader Registers in DISTRIBUTED COMPUTING
  • 2002 Meaningful Information in ALGORITHMS AND COMPUTATION
  • 2001-07-04 Time and Space Bounds for Reversible Simulation in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2001 The Quantum Computing Challenge in INFORMATICS
  • 2001 On a Generalized Ruin Problem in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES
  • 2000-09 Average-case analysis of algorithms using Kolmogorov complexity in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2000 The Incompressibility Method in SOFSEM 2000: THEORY AND PRACTICE OF INFORMATICS
  • 2000 Towards an Algorithmic Statistics in ALGORITHMIC LEARNING THEORY
  • 1999-01 The erdős graph and the beast in THE MATHEMATICAL INTELLIGENCER
  • 1998-08 Randomized naming using wait-free shared variables in DISTRIBUTED COMPUTING
  • 1997-09 The miraculous universal distribution in THE MATHEMATICAL INTELLIGENCER
  • 1997 Mutual search in COMPUTING AND COMBINATORICS
  • 1997 On prediction by data compression in MACHINE LEARNING: ECML-97
  • 1997 Average-Case Analysis Using Kolmogorov Complexity in ADVANCES IN ALGORITHMS, LANGUAGES, AND COMPLEXITY
  • 1996 Genetic fitness optimization using rapidly mixing Markov chains in ALGORITHMIC LEARNING THEORY
  • 1995 Computational machine learning in theory and praxis in COMPUTER SCIENCE TODAY
  • 1995 Algorithmic arguments in physics of computation in ALGORITHMS AND DATA STRUCTURES
  • 1995 Physics and the new computation in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1995
  • 1994-07 Statistical properties of finite sequences with high Kolmogorov complexity in MATHEMATICAL SYSTEMS THEORY
  • 1994 Randomized wait-free naming in ALGORITHMS AND COMPUTATION
  • 1992-06 A note on weighted distributed match-making in MATHEMATICAL SYSTEMS THEORY
  • 1992 Wait-free test-and-set in DISTRIBUTED ALGORITHMS
  • 1992 Philosophical issues in Kolmogorov complexity in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1990 Applications of Kolmogorov Complexity in the Theory of Computation in COMPLEXITY THEORY RETROSPECTIVE
  • 1989 How to share concurrent asynchronous wait-free variables in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1989 A new approach to formal language theory by kolmogorov complexity in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988-11 Distributed match-making in ALGORITHMICA
  • 1988 Weighted distributed match-making in VLSI ALGORITHMS AND ARCHITECTURES
  • 1988 A proof technique for register atomicity in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1988 A Modest Proposal for Communication Costs in Multicomputers in CONCURRENT COMPUTATIONS
  • 1986 Development, Growth and Time in THE BOOK OF L
  • 1986 The power of the queue in STRUCTURE IN COMPLEXITY THEORY
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.7177.6", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.6054.7", 
            "type": "Organization"
          }
        ], 
        "familyName": "Vit\u00e1nyi", 
        "givenName": "Paul", 
        "id": "sg:person.014213763741.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014213763741.01"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:40", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1451.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.014213763741.01'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.014213763741.01'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.014213763741.01'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.014213763741.01'


     




    Preview window. Press ESC to close (or click here)


    ...