dblp.uni-trier.dewww.uni-trier.de

Mitsunori Ogihara

Mitsunori Ogiwara

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
132EEBo Shao, Tao Li, Mitsunori Ogihara: Quantify music artist similarity based on style and mood. WIDM 2008: 119-124
131EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Text categorization via generalized discriminant analysis. Inf. Process. Manage. 44(5): 1684-1697 (2008)
2007
130EERemco Loos, Mitsunori Ogihara: Complexity Theory for Splicing Systems. Developments in Language Theory 2007: 300-311
129EEXipeng Shen, Michael L. Scott, Chengliang Zhang, Sandhya Dwarkadas, Chen Ding, Mitsunori Ogihara: Analysis of input-dependent program behavior using active profiling. Experimental Computer Science 2007: 5
128EEHaiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogihara, Oliver Spatscheck, Jia Wang, Jun Xu: A data streaming algorithm for estimating entropies of od flows. Internet Measurement Comference 2007: 279-290
127EEChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007)
126EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Hierarchical document classification using automatically generated hierarchy. J. Intell. Inf. Syst. 29(2): 211-230 (2007)
125EERemco Loos, Mitsunori Ogihara: Complexity theory for splicing systems. Theor. Comput. Sci. 386(1-2): 132-150 (2007)
2006
124EETao Li, Mitsunori Ogihara, Shenghuo Zhu: Integrating Features from Different Sources for Music Information Retrieval. ICDM 2006: 372-381
123EEChengliang Zhang, Kirk Kelsey, Xipeng Shen, Chen Ding, Matthew Hertz, Mitsunori Ogihara: Program-level adaptive memory management. ISMM 2006: 174-183
122EELance Fortnow, Mitsunori Ogihara: Very Sparse Leaf Languages. MFCS 2006: 375-386
121EEQi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu: Finding global icebergs over distributed data sets. PODS 2006: 298-307
120EEChengliang Zhang, Chen Ding, Mitsunori Ogihara, Yutao Zhong, Youfeng Wu: A hierarchical model of data locality. POPL 2006: 16-29
119EEAshwin Lall, Vyas Sekar, Mitsunori Ogihara, Jun Xu, Hui Zhang: Data streaming algorithms for estimating entropy of network traffic. SIGMETRICS/Performance 2006: 145-156
118EEMitsunori Ogihara: Molecular Computation. Recent Advances in Formal Languages and Applications 2006: 255-267
117EETao Li, Mitsunori Ogihara: Toward intelligent music information retrieval. IEEE Transactions on Multimedia 8(3): 564-574 (2006)
116EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Using discriminant analysis for multi-class classification: an experimental investigation. Knowl. Inf. Syst. 10(4): 453-472 (2006)
115EELane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand: The Complexity of Finding Top-Toda-Equivalence-Class Members. Theory Comput. Syst. 39(5): 669-684 (2006)
2005
114EEPiotr Faliszewski, Mitsunori Ogihara: Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315
113EEChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398
112EEChen Ding, Chengliang Zhang, Xipeng Shen, Mitsunori Ogihara: Gated memory control for memory monitoring, leak detection and garbage collection. Memory System Performance 2005: 62-67
111 Tao Li, Sheng Ma, Mitsunori Ogihara: Wavelet Methods in Data Mining. The Data Mining and Knowledge Discovery Handbook 2005: 603-626
110EEChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity Electronic Colloquium on Computational Complexity (ECCC)(011): (2005)
109EEJin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara: Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1): 1-23 (2005)
108EETao Li, Mitsunori Ogihara: Semisupervised learning from different information sources. Knowl. Inf. Syst. 7(3): 289-309 (2005)
107EEAlina Beygelzimer, Mitsunori Ogihara: The enumerability of P collapses P to NC. Theor. Comput. Sci. 345(2-3): 248-259 (2005)
2004
106EETao Li, Mitsunori Ogihara: Music artist style identification by semi-supervised learning from both lyrics and content. ACM Multimedia 2004: 364-367
105EETao Li, Mitsunori Ogihara: Semi-supervised learning for music artists style identification. CIKM 2004: 152-153
104EETao Li, Mitsunori Ogihara, Sheng Ma: On combining multiple clusterings. CIKM 2004: 294-303
103EETao Li, Sheng Ma, Mitsunori Ogihara: Entropy-based criterion in categorical clustering. ICML 2004
102EELane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand: The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004: 90-99
101EEAlina Beygelzimer, Mitsunori Ogihara: The Enumerability of P Collapses P to NC. MFCS 2004: 346-355
100EETao Li, Sheng Ma, Mitsunori Ogihara: Document clustering via adaptive subspace iteration. SIGIR 2004: 218-225
99EETao Li, Chengliang Zhang, Mitsunori Ogihara: A comparative study of feature selection and multiclass classification methods for tissue classification based on gene expression. Bioinformatics 20(15): 2429-2437 (2004)
98EEMitsunori Ogihara, Till Tantau: On the reducibility of sets inside NP to sets with low information content. J. Comput. Syst. Sci. 69(4): 499-524 (2004)
2003
97EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Efficient multi-way text categorization via generalized discriminant analysis. CIKM 2003: 317-324
96EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Using Discriminant Analysis for Multi-class Classification. ICDM 2003: 589-592
95EETao Li, Mitsunori Ogihara: Detecting emotion in music. ISMIR 2003
94 Tao Li, Shenghuo Zhu, Mitsunori Ogihara: A New Distributed Data Mining Model Based on Similarity. SAC 2003: 432-436
93 Tao Li, Shenghuo Zhu, Qi Li, Mitsunori Ogihara: Gene Functional Classification by Semisupervised Learning from Heterogeneous Data. SAC 2003: 78-82
92EETao Li, Mitsunori Ogihara, Qi Li: A comparative study on content-based music genre classification. SIGIR 2003: 282-289
91EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Topic hierarchy generation via linear discriminant projection. SIGIR 2003: 421-422
90EEJin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara: Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003: 535-546
89 Rahul Bijlani, Yinhe Cheng, David A. Pearce, Andrew I. Brooks, Mitsunori Ogihara: Prediction of biologically significant components from microarray data: Independently Consistent Expression Discriminator (ICED). Bioinformatics 19(1): 62-70 (2003)
88EETao Li, Mitsunori Ogihara, Shenghuo Zhu: Association-based similarity testing and its applications. Intell. Data Anal. 7(3): 209-232 (2003)
87EETao Li, Shenghuo Zhu, Mitsunori Ogihara: Algorithms for clustering high dimensional and distributed data. Intell. Data Anal. 7(4): 305-326 (2003)
86EEMaciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 1-3(304): 129-156 (2003)
85EERichard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein: A Note on Square Rooting of Time Functions of Turing Machines. Theory Comput. Syst. 36(3): 295-299 (2003)
84EEAlina Beygelzimer, Mitsunori Ogihara: The (Non)Enumerability of the Determinant and the Rank. Theory Comput. Syst. 36(4): 359-374 (2003)
2002
83EETao Li, Shenghuo Zhu, Mitsunori Ogihara, Yinhe Cheng: Estimating Joint Probabilities from Marginal Ones. DaWaK 2002: 31-41
82EEShenghuo Zhu, Tao Li, Mitsunori Ogihara: CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces. DaWaK 2002: 52-62
81 Alina Beygelzimer, Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank. IFIP TCS 2002: 59-70
80EEMitsunori Ogihara, Animesh Ray: The Minimum-Model DNA Computation on a Sequence of Probe Arrays. UMC 2002: 38-49
79EEAlina Beygelzimer, Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank Electronic Colloquium on Computational Complexity (ECCC)(016): (2002)
78EELane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung: Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64(2): 311-328 (2002)
77EETao Li, Qi Li, Shenghuo Zhu, Mitsunori Ogihara: A Survey on Wavelet Applications in Data Mining. SIGKDD Explorations 4(2): 49-68 (2002)
76EEMitsunori Ogihara, Anne Condon: Guest Editors' Foreword. Theory Comput. Syst. 35(5): 469 (2002)
2001
75EEMitsunori Ogihara, Seinosuke Toda: The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. MFCS 2001: 585-597
74EEMitsunori Ogihara, Seinosuke Toda: The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs Electronic Colloquium on Computational Complexity (ECCC) 8(061): (2001)
73EESrinivasan Parthasarathy, Mohammed Javeed Zaki, Mitsunori Ogihara, Wei Li: Parallel Data Mining for Association Rules on Shared-Memory Systems. Knowl. Inf. Syst. 3(1): 1-29 (2001)
2000
72EESergio Díaz, Juan Luis Esteban, Mitsunori Ogihara: A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing 2000: 209-219
71EESrinivasan Parthasarathy, Mitsunori Ogihara: Exploiting Dataset Similarity for Distributed Mining. IPDPS Workshops 2000: 399-406
70EELane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung: Reducing the Number of Solutions of NP Functions. MFCS 2000: 394-404
69EESrinivasan Parthasarathy, Mitsunori Ogihara: Clustering Distributed Homogeneous Datasets. PKDD 2000: 566-574
68 Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara: PlanMine: Predicting Plan Failures Using Sequence Mining. Artif. Intell. Rev. 14(6): 421-446 (2000)
67EENeal Lesh, Mohammed Javeed Zaki, Mitsunori Ogihara: Scalable Feature Mining for Sequential Data. IEEE Intelligent Systems 15(2): 48-56 (2000)
66 Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. Inf. Comput. 158(1): 29-52 (2000)
65EELane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara: Erratum to "Reducibility classes of P-selective sets". Theor. Comput. Sci. 234(1-2): 323 (2000)
1999
64EESrinivasan Parthasarathy, Mohammed Javeed Zaki, Mitsunori Ogihara, Sandhya Dwarkadas: Incremental and Interactive Sequence Mining. CIKM 1999: 251-258
63EENeal Lesh, Mohammed Javeed Zaki, Mitsunori Ogihara: Mining Features for Sequence Classification. KDD 1999: 342-346
62EESrinivasan Parthasarathy, Sandhya Dwarkadas, Mitsunori Ogihara: Active Mining in a Distributed Setting. Large-Scale Parallel Data Mining 1999: 65-82
61EEMitsunori Ogihara, Animesh Ray: Simulating Boolean Circuits on a DNA Computer. Algorithmica 25(2-3): 239-250 (1999)
60 Eric Allender, Robert Beals, Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity 8(2): 99-126 (1999)
1998
59 Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara: PlanMine: Sequence Mining for Plan Failures. KDD 1998: 369-374
58EEJudy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. MFCS 1998: 483-492
57EEJudy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions CoRR cs.CC/9809002: (1998)
56EEMitsunori Ogihara: The PL Hierarchy Collapses. SIAM J. Comput. 27(5): 1430-1437 (1998)
55EEIoan I. Macarie, Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata. Theor. Comput. Sci. 207(1): 117-130 (1998)
1997
54 Dieter van Melkebeek, Mitsunori Ogihara: Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997: 191-208
53 Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li: New Algorithms for Fast Discovery of Association Rules. KDD 1997: 283-286
52EEMitsunori Ogihara, Animesh Ray: Simulating Boolean circuits on a DNA computer. RECOMB 1997: 226-231
51 Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li, Mitsunori Ogihara: Evaluation of Sampling for Data Mining of Association Rules. RIDE 1997: 0-
50 Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li: Parallel Algorithms for Discovery of Association Rules. Data Min. Knowl. Discov. 1(4): 343-373 (1997)
49 Lane A. Hemaspaandra, Mitsunori Ogihara: Universally Serializable Computation. J. Comput. Syst. Sci. 55(3): 547-560 (1997)
48 Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman: Oracles that Compute Values. SIAM J. Comput. 26(4): 1043-1065 (1997)
1996
47EEEric Allender, Robert Beals, Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC 1996: 161-167
46EEMitsunori Ogihara: The PL Hierarchy Collapses. STOC 1996: 84-88
45EEMitsunori Ogihara: Sparse Hard Sets for P Yield Space-Efficient Algorithms. Chicago J. Theor. Comput. Sci. 1996: (1996)
44EEMitsunori Ogihara: The PL Hierarchy Collapses Electronic Colloquium on Computational Complexity (ECCC) 3(13): (1996)
43EEMitsunori Ogihara: Sparse Hard Sets for P Yields Space-Efficient Algorithms Electronic Colloquium on Computational Complexity (ECCC) 3(14): (1996)
42EEEric Allender, Robert Beals, Mitsunori Ogihara: The complexity of matrix rank and feasible systems of linear equations Electronic Colloquium on Computational Complexity (ECCC) 3(24): (1996)
41EELane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 3(27): (1996)
40 Eric Allender, Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. ITA 30(1): 1-21 (1996)
39EEMitsunori Ogihara: Functions Computable with Limited Access to NP. Inf. Process. Lett. 58(1): 35-38 (1996)
38 Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe: On Closure Properties of #P in the Context of PF ° #P. J. Comput. Syst. Sci. 53(2): 171-179 (1996)
37 Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53(2): 194-209 (1996)
36 Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25(4): 697-708 (1996)
35EELane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara: Reducibility Classes of P-Selective Sets. Theor. Comput. Sci. 155(2): 447-457 (1996)
1995
34 Ioan I. Macarie, Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata (Extended Abstract). FCT 1995: 343-352
33 Mitsunori Ogihara: Sparse P-Hard Sets Yield Space-Efficient Algorithms. FOCS 1995: 354-361
32 Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar: Communication Complexity of Key Agreement on Small Ranges. STACS 1995: 38-49
31 Mitsunori Ogihara: Equivalence of NC^k and AC^k-1 closures of NP and Other Classes Inf. Comput. 120(1): 55-58 (1995)
30EEMitsunori Ogihara: On Helping by Parity-Like Languages. Inf. Process. Lett. 54(1): 41-43 (1995)
29 Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang: Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. 6(4): 403-416 (1995)
28 Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. SIAM J. Comput. 24(5): 1068-1081 (1995)
1994
27 Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64
26 Mitsunori Ogiwara: NC^k(NP) = AC^(k-1)(NP). STACS 1994: 313-324
25 Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. Structure in Complexity Theory Conference 1994: 2-11
24 Eric Allender, Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. Structure in Complexity Theory Conference 1994: 267-278
23 Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda: Space-Efficient Recognition of Sparse Self-Reducible Languages. Computational Complexity 4: 262-296 (1994)
22 Mitsunori Ogihara: On Serializable Languages. Int. J. Found. Comput. Sci. 5(3/4): 303-318 (1994)
21 Mitsunori Ogiwara: Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes. Mathematical Systems Theory 27(3): 189-200 (1994)
1993
20 Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang: Selectivity. ICCI 1993: 55-59
19 Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman: On Using Oracles That Compute Values. STACS 1993: 398-407
18 Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe: On Closure Properties of #P in the Context of PF°#P. Structure in Complexity Theory Conference 1993: 139-146
17 Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman: P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Structure in Complexity Theory Conference 1993: 52-64
16 Mitsunori Ogiwara, Lane A. Hemachandra: A Complexity Theory for Feasible Closure Properties. J. Comput. Syst. Sci. 46(3): 295-325 (1993)
15 Richard Beigel, Richard Chang, Mitsunori Ogiwara: A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Mathematical Systems Theory 26(3): 293-310 (1993)
14 Mitsunori Ogiwara, Antoni Lozano: On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112(2): 255-275 (1993)
1992
13 Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46
12 Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. ICALP 1992: 162-173
11 Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: How Hard Are Sparse Sets? Structure in Complexity Theory Conference 1992: 222-238
10 Lane A. Hemachandra, Mitsunori Ogiwara: Is #P Closed under Substraction? Bulletin of the EATCS 46: 107-123 (1992)
9 Seinosuke Toda, Mitsunori Ogiwara: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21(2): 316-328 (1992)
8 Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21(3): 521-539 (1992)
1991
7 Mitsunori Ogiwara, Antoni Lozano: On One Query Self-Reducible Sets. Structure in Complexity Theory Conference 1991: 139-151
6 Mitsunori Ogiwara, Lane A. Hemachandra: A Complexity Theory for Feasible Closure Properties. Structure in Complexity Theory Conference 1991: 16-29
5 Seinosuke Toda, Mitsunori Ogiwara: Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. Structure in Complexity Theory Conference 1991: 2-12
4 Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. Structure in Complexity Theory Conference 1991: 220-229
3 Mitsunori Ogiwara, Osamu Watanabe: On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. SIAM J. Comput. 20(3): 471-483 (1991)
1990
2 Mitsunori Ogiwara, Osamu Watanabe: On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets STOC 1990: 457-467
1 Mitsunori Ogiwara, Osamu Watanabe: On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). Structure in Complexity Theory Conference 1990: 2

Coauthor Index

1Eric Allender [4] [8] [24] [40] [42] [47] [60]
2Vikraman Arvind [12] [13]
3Robert Beals [42] [47] [60]
4Richard Beigel [15]
5Alina Beygelzimer [79] [81] [84] [101] [107]
6Rahul Bijlani [89]
7Andrew I. Brooks [89]
8Jin-yi Cai [32] [90] [109]
9Venkatesan T. Chakaravarthy [90] [109]
10Richard Chang [15]
11Yinhe Cheng [83] [89]
12Anne Condon [76]
13Sergio Díaz [72]
14Chen Ding [112] [120] [123] [129]
15Sandhya Dwarkadas [62] [64] [129]
16Juan Luis Esteban [72]
17Piotr Faliszewski [114]
18Stephen A. Fenner [19] [48]
19Lance Fortnow [122]
20Christian Glaßer (Christian Glasser) [110] [113] [127]
21Judy Goldsmith [57] [58] [66]
22Yenjo Han [12] [13]
23Edith Hemaspaandra (Edith Spaan) [37]
24Lane A. Hemaspaandra (Lane A. Hemachandra) [4] [6] [8] [10] [11] [12] [13] [16] [20] [23] [27] [29] [35] [36] [41] [49] [65] [70] [78] [90] [102] [109] [115]
25Matthew Hertz [123]
26Albrecht Hoene [20] [29] [35] [65]
27Steven Homer [19] [48]
28Kirk Kelsey [123]
29Johannes Köbler [12] [13]
30Ashwin Lall [119] [128]
31Neal Lesh [59] [63] [67] [68]
32Qi Li [77] [92] [93]
33Tao Li [77] [82] [83] [87] [88] [91] [92] [93] [94] [95] [96] [97] [99] [100] [103] [104] [105] [106] [108] [111] [116] [117] [124] [126] [131] [132]
34Wei Li [50] [51] [53] [73]
35Richard J. Lipton [32] [85]
36Maciej Liskiewicz [86]
37Luc Longpré [32]
38Remco Loos [125] [130]
39Antoni Lozano [7] [12] [13] [14]
40Sheng Ma [100] [103] [104] [111]
41Ioan I. Macarie [34] [55]
42Dieter van Melkebeek [54]
43Martin Mundhenk [12] [13]
44Ashish V. Naik [17] [27] [29] [36] [37] [41]
45Srinivasan Parthasarathy [50] [51] [53] [62] [64] [69] [71] [73]
46Aduri Pavan [110] [113] [127]
47David A. Pearce [89]
48Animesh Ray [52] [61] [80]
49Kenneth W. Regan [32]
50Jörg Rothe [57] [58] [66]
51Uwe Schöning [12] [13]
52Michael L. Scott [129]
53Vyas Sekar [119]
54Alan L. Selman [17] [19] [20] [27] [29] [36] [37] [41] [48] [110] [113] [127]
55Bo Shao [132]
56Xipeng Shen [112] [123] [129]
57Riccardo Silvestri [12] [13]
58D. Sivakumar [32]
59Oliver Spatscheck [128]
60Till Tantau [98]
61Thomas Thierauf [12] [13] [18] [20] [29] [38]
62Seinosuke Toda [5] [9] [18] [23] [38] [74] [75] [86]
63Haixun Wang [121]
64Jia Wang [128]
65Jie Wang [20] [29]
66Osamu Watanabe [1] [2] [3] [4] [8] [11] [18] [38]
67Gerd Wechsung [70] [78]
68Youfeng Wu [120]
69Jun Xu [119] [121] [128]
70Mohammed Javeed Zaki (Mohammed J. Zaki) [50] [51] [53] [59] [63] [64] [67] [68] [73] [102] [115]
71Yechezkel Zalcstein [85]
72Chengliang Zhang [99] [112] [120] [123] [129]
73Hui Zhang [119]
74Liyu Zhang [110] [113] [127]
75Haiquan (Chuck) Zhao [128]
76Qi Zhao [121]
77Yutao Zhong [120]
78Shenghuo Zhu [77] [82] [83] [87] [88] [91] [93] [94] [96] [97] [116] [124] [126] [131]
79Marius Zimand [102] [115]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)