| Year |
Citation |
Score |
| 2019 |
Kawachi A, Ogihara M, Uchizawa K. Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs Theoretical Computer Science. 762: 25-40. DOI: 10.1016/J.Tcs.2018.08.026 |
0.311 |
|
| 2010 |
Zhao H, Lall A, Ogihara M, Xu J. Global iceberg detection over distributed data streams Proceedings - International Conference On Data Engineering. 557-568. DOI: 10.1109/ICDE.2010.5447825 |
0.443 |
|
| 2010 |
Faliszewski P, Ogihara M. On the autoreducibility of functions Theory of Computing Systems. 46: 222-245. DOI: 10.1007/S00224-008-9127-9 |
0.316 |
|
| 2009 |
Lall A, Ogihara M, Xu J. An efficient algorithm for measuring medium- to large-sized flows in network traffic Proceedings - Ieee Infocom. 2711-2715. DOI: 10.1109/INFCOM.2009.5062217 |
0.462 |
|
| 2008 |
Li T, Zhu S, Ogihara M. Text categorization via generalized discriminant analysis Information Processing and Management. 44: 1684-1697. DOI: 10.1016/J.Ipm.2008.03.005 |
0.326 |
|
| 2007 |
Glaßer C, Ogihara M, Pavan A, Selman AL, Zhang L. Autoreducibility, mitoticity, and immunity Journal of Computer and System Sciences. 73: 735-754. DOI: 10.1016/J.Jcss.2006.10.020 |
0.319 |
|
| 2006 |
Li T, Ogihara M. Toward intelligent music information retrieval Ieee Transactions On Multimedia. 8: 564-574. DOI: 10.1109/Tmm.2006.870730 |
0.308 |
|
| 2006 |
Li T, Zhu S, Ogihara M. Using discriminant analysis for multi-class classification: An experimental investigation Knowledge and Information Systems. 10: 453-472. DOI: 10.1007/S10115-006-0013-Y |
0.32 |
|
| 2006 |
Hemaspaandra LA, Ogihara M, Zaki MJ, Zimand M. The complexity of finding top-toda-equivalence-class members Theory of Computing Systems. 39: 669-684. DOI: 10.1007/S00224-005-1211-9 |
0.382 |
|
| 2005 |
Beygelzimer A, Ogihara M. The enumerability of P collapses P to NC Theoretical Computer Science. 345: 248-259. DOI: 10.1016/j.tcs.2005.07.010 |
0.656 |
|
| 2005 |
Cai JY, Chakaravarthy VT, Hemaspaandra LA, Ogihara M. Competing provers yield improved Karp-Lipton collapse results Information and Computation. 198: 1-23. DOI: 10.1016/J.Ic.2005.01.002 |
0.322 |
|
| 2004 |
Ogihara M, Tantau T. On the reducibility of sets inside NP to sets with low information content Journal of Computer and System Sciences. 69: 499-524. DOI: 10.1016/J.Cam.2004.03.003 |
0.359 |
|
| 2003 |
Bijlani R, Cheng Y, Pearce DA, Brooks AI, Ogihara M. Prediction of biologically significant components from microarray data: Independently Consistent Expression Discriminator (ICED). Bioinformatics (Oxford, England). 19: 62-70. PMID 12499294 DOI: 10.1093/Bioinformatics/19.1.62 |
0.538 |
|
| 2003 |
Liśkiewicz M, Ogihara M, Toda S. The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes Theoretical Computer Science. 304: 129-156. DOI: 10.1016/S0304-3975(03)00080-X |
0.383 |
|
| 2003 |
Beygelzimer A, Ogihara M. The (non)enumerability of the determinant and the rank Theory of Computing Systems. 36: 359-374. DOI: 10.1007/S00224-003-1091-9 |
0.69 |
|
| 2002 |
Beygelzimer A, Ogihara M. On the enumerability of the determinant and the rank Ifip Advances in Information and Communication Technology. 96: 59-70. |
0.677 |
|
| 2000 |
Hemaspaandra L, Hoene A, Ogihara M. Erratum to “reducibility classes of P -selective sets” Theoretical Computer Science. 234: 323. DOI: 10.1016/S0304-3975(99)00298-4 |
0.302 |
|
| 1999 |
Allender E, Beals R, Ogihara M. The complexity of matrix rank and feasible systems of linear equations Computational Complexity. 8: 99-126. DOI: 10.1007/S000370050023 |
0.333 |
|
| 1999 |
Ogihara M, Ray A. Simulating Boolean circuits on a DNA computer Algorithmica (New York). 25: 239-250. DOI: 10.1007/Pl00008276 |
0.309 |
|
| 1998 |
Goldsmith J, Ogihara M, Rothe J. Tally NP sets and easy census functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1450: 483-492. DOI: 10.1006/Inco.1999.2810 |
0.389 |
|
| 1997 |
Fenner S, Homer S, Ogihara M, Selman A. Oracles That Compute Values Siam Journal On Computing. 26: 1043-1065. DOI: 10.1137/S0097539793247439 |
0.329 |
|
| 1997 |
Zaki MJ, Parthasarathy S, Ogihara M, Li W. Parallel Algorithms for Discovery of Association Rules Data Mining and Knowledge Discovery. 1: 343-373. DOI: 10.1023/A:1009773317876 |
0.316 |
|
| 1996 |
Allender E, Ogihara M. Relationships among $PL$, $\#L$, and the determinant Theoretical Informatics and Applications. 30: 1-21. DOI: 10.1051/Ita/1996300100011 |
0.335 |
|
| 1996 |
Hemaspaandra LA, Hoene A, Ogihara M. Reducibility classes of P-selective sets Theoretical Computer Science. 155: 447-457. DOI: 10.1016/0304-3975(96)00094-1 |
0.358 |
|
| 1996 |
Ogihara M. Functions computable with limited access to NP Information Processing Letters. 58: 35-38. DOI: 10.1016/0020-0190(96)00030-0 |
0.313 |
|
| 1996 |
Hemaspaandra E, Naik AV, Ogihara M, Selman AL. P-selective sets and reducing search to decision vs self-reducibility Journal of Computer and System Sciences. 53: 194-209. DOI: 10.1006/Jcss.1996.0061 |
0.304 |
|
| 1996 |
Ogihara M, Thierauf T, Toda S, Watanabe O. On Closure Properties of #P in the Context of PF∘#P Journal of Computer and System Sciences. 53: 171-179. DOI: 10.1006/Jcss.1996.0059 |
0.309 |
|
| 1995 |
Hemaspaandra LA, Hoene A, Naik AV, Ogihara M, Selman AL, Thierauf T, Wang J. Nondeterministically Selective Sets International Journal of Foundations of Computer Science. 6: 403-416. DOI: 10.1142/S0129054195000214 |
0.331 |
|
| 1995 |
Ogihara M. Polynomial-time membership comparable sets Siam Journal On Computing. 24: 1068-1081. DOI: 10.1137/S0097539793258131 |
0.325 |
|
| 1994 |
Macarie II, Ogihara M. Properties of Probabilistic Pushdown Automata Theoretical Computer Science. 207: 117-130. DOI: 10.1016/S0304-3975(98)00059-0 |
0.329 |
|
| 1994 |
Hemaspaandra LA, Ogihara M, Toda S. Space-efficient recognition of sparse self-reducible languages Computational Complexity. 4: 262-296. DOI: 10.1007/Bf01206639 |
0.365 |
|
| Show low-probability matches. |