The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Péter Gács: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Péter Gács, John Tromp, Paul M. B. Vitányi
    Towards an Algorithmic Statistics. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:41-55 [Conf]
  2. Péter Gács
    Quantum Algorithmic Entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:274-283 [Conf]
  3. Péter Gács
    On the Relation between Descriptional Complexity and Algorithmic Probability [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:296-303 [Conf]
  4. Péter Gács
    Reliable Cellular Automata with Self-Organization. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:90-99 [Conf]
  5. Aditi Dhagat, Péter Gács, Peter Winkler
    On Playing "Twenty Questions" with a Liar. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:16-22 [Conf]
  6. Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
    Thermodynamics of computation and information distance. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:21-30 [Conf]
  7. Péter Gács
    Compatible sequences and a slow Winkler percolation. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:694-703 [Conf]
  8. Péter Gács
    Clairvoyant scheduling of random walks. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:99-108 [Conf]
  9. Péter Gács
    Reliable Computation with Cellular Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:32-41 [Conf]
  10. Péter Gács, John H. Reif
    A Simple Three-Dimensional Real-Time Reliable Cellular Array [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:388-395 [Conf]
  11. Péter Gács
    Exact Expressions for some Randomness Tests. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:124-131 [Conf]
  12. Péter Gács
    Universal randomness test, over a general space [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  13. Péter Gács
    Deterministic computations whose history is independent of the order of asynchronous updating [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  14. Péter Gács
    Reliable Cellular Automata with Self-Organization [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  15. Péter Gács, John Tromp, Paul M. B. Vitányi
    Algorithmic Statistics [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  16. Péter Gács
    The Clairvoyant Demon Has A Hard Task. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal]
  17. Péter Gács
    Compatible Sequences and a Slow Winkler Percolation. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:815-856 [Journal]
  18. Péter Gács
    Every Sequence Is Reducible to a Random One [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:70, n:2/3, pp:186-192 [Journal]
  19. Péter Gács, Leonid A. Letvin
    Causal Nets or What is a Deterministic Computation [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:51, n:1, pp:1-19 [Journal]
  20. Péter Gács
    Reliable Computation with Cellular Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:1, pp:15-78 [Journal]
  21. Péter Gács, John H. Reif
    A Simple Three-Dimensional Real-Time Reliable Cellular Array. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:125-147 [Journal]
  22. Péter Gács
    Uniform test of algorithmic randomness over a general space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:91-137 [Journal]
  23. Péter Gács
    On the Relation between Descriptional Complexity and Algorithmic Probability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:71-93 [Journal]
  24. Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
    Information Distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1407-1423 [Journal]
  25. Péter Gács, A. Gal
    Lower bounds for the complexity of reliable Boolean circuits with noisy gates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:579-0 [Journal]
  26. Péter Gács, John Tromp, Paul M. B. Vitányi
    Algorithmic statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2443-2463 [Journal]
  27. Péter Gács, John Tromp, Paul M. B. Vitányi
    Correction to "Algorithmic statistics". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2427- [Journal]

  28. Randomness on Computable Probability Spaces - A Dynamical Point of View. [Citation Graph (, )][DBLP]


  29. Information Distance [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002