Language compression and pseudorandom generators

Article Properties
Cite
Buhrman, Harry, et al. “Language Compression and Pseudorandom Generators”. Computational Complexity, vol. 14, no. 3, 2005, pp. 228-55, https://doi.org/10.1007/s00037-005-0199-5.
Buhrman, H., Lee, T., & Melkebeek, D. van. (2005). Language compression and pseudorandom generators. Computational Complexity, 14(3), 228-255. https://doi.org/10.1007/s00037-005-0199-5
Buhrman H, Lee T, Melkebeek D van. Language compression and pseudorandom generators. computational complexity. 2005;14(3):228-55.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
You May Also Like
Citations
Title Journal Journal Categories Citations Publication Date
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2023
On Optimal Language Compression for Sets in PSPACE/poly Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2014
Reconstructive Dispersers and Hitting Set Generators Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 1 2008
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software3
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods2
Science: Mathematics2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Engineering (General). Civil engineering (General)1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 3 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Reconstructive Dispersers and Hitting Set Generators and was published in 2008. The most recent citation comes from a 2023 study titled Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\). This article reached its peak citation in 2023, with 1 citations. It has been cited in 3 different journals. Among related journals, the SIAM Journal on Computing cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year