A note on read-$k$ times branching programs

Article Properties
Cite
Jukna, Stasys. “A Note on Read-$k$ Times Branching Programs”. RAIRO - Theoretical Informatics and Applications, vol. 29, no. 1, 1995, pp. 75-83, https://doi.org/10.1051/ita/1995290100751.
Jukna, S. (1995). A note on read-$k$ times branching programs. RAIRO - Theoretical Informatics and Applications, 29(1), 75-83. https://doi.org/10.1051/ita/1995290100751
Jukna S. A note on read-$k$ times branching programs. RAIRO - Theoretical Informatics and Applications. 1995;29(1):75-83.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
10.1007/3-540-54458-5_49
10.1016/0304-3975(91)90021-S
10.1007/3-540-51498-8_24
Nondeterministic Space is Closed under Complementation 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
 208 1988
10.1016/S0019-9958(60)90287-4
Citations
Title Journal Journal Categories Citations Publication Date
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth 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)
 5 2015
Limitations of Incremental Dynamic Programming 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)
 6 2013
Yet harder knapsack problems Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • 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
 4 2011
A nondeterministic space-time tradeoff for linear codes Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2 2009
Expanders and time-restricted branching programs Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • 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
 1 2008
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science13
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software12
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware10
Science: Mathematics5
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods5
Technology: Engineering (General). Civil engineering (General)4
Technology: Technology (General): Industrial engineering. Management engineering: Information technology3
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication3
Science: Science (General): Cybernetics: Information theory3
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 13 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A lower bound on branching programs reading some bits twice and was published in 1997. The most recent citation comes from a 2015 study titled On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. This article reached its peak citation in 2003, with 2 citations. It has been cited in 7 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year