Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1999/10/01
-
Indian UGC (journal)
-
Refrences40
-
Citations23
-
Eric Allender
-
Klaus Reinhardt
-
Shiyu Zhou
Cite
Allender, Eric, et al. “Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds”. Journal of Computer and System Sciences, vol. 59, no. 2, 1999, pp. 164-81, https://doi.org/10.1006/jcss.1999.1646.
Allender, E., Reinhardt, K., & Zhou, S. (1999). Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. Journal of Computer and System Sciences, 59(2), 164-181. https://doi.org/10.1006/jcss.1999.1646
Allender, Eric, Klaus Reinhardt, and Shiyu Zhou. “Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds”. Journal of Computer and System Sciences 59, no. 2 (1999): 164-81. https://doi.org/10.1006/jcss.1999.1646.
Allender E, Reinhardt K, Zhou S. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. Journal of Computer and System Sciences. 1999;59(2):164-81.
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
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The PL hierarchy collapses | SIAM Journal on Computing |
| 1998 | |
| Verifying the determinant | computational complexity |
| 1998 | |
Making computation count | ACM SIGACT News | 8 | 1997 | |
| Relationships among $PL$, $\#L$, and the determinant | RAIRO - Theoretical Informatics and Applications |
| 24 | 1996 |
| Hardness vs. randomness | Journal of Computer and System Sciences |
| 1994 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 27
is the most frequently represented among the references in this article. It primarily includes studies from SIAM Journal on Computing and Journal of Computer and System Sciences. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Guest Column | ACM SIGACT News | 2023 | ||
Code-routing: a new attack on position verification | Quantum |
| 1 | 2023 |
| Depth-first search in directed planar graphs, revisited | Acta Informatica |
| 1 | 2022 |
| A Combinatorial Property of ♯L Assuming Nl = Ul and its Implications for Modl | SSRN Electronic Journal | 2022 | ||
| Derandomizing Isolation in Space-Bounded Settings | SIAM Journal on Computing |
| 2019 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 18
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Making Nondeterminism Unambiguous and was published in 2000. The most recent citation comes from a 2023 study titled Code-routing: a new attack on position verification. This article reached its peak citation in 2012, with 4 citations. It has been cited in 13 different journals, 7% of which are open access. Among related journals, the SIAM Journal on Computing cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.