![]() | ![]() |
| 2012 | ||
|---|---|---|
| 126 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. FAW-AAIM 2012: 172-181 | |
| 125 | Bin Fu: Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP. FAW-AAIM 2012: 182-191 | |
| 124 | Zhixiang Chen, Bin Fu, Binhai Zhu: Erratum: The Approximability of the Exemplar Breakpoint Distance Problem. FAW-AAIM 2012: 368 | |
| 123 | Zaixin Lu, Yan Shi, Weili Wu, Bin Fu: Efficient data retrieval scheduling for multi-channel wireless data broadcast. INFOCOM 2012: 891-899 | |
| 122 | Bin Fu: NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets. LATIN 2012: 375-386 | |
| 121 | Bin Fu, Zhihai Wang, Rong Pan, Guandong Xu, Peter Dolog: Learning Tree Structure of Label Dependency for Multi-label Learning. PAKDD (1) 2012: 159-170 | |
| 120 | Bin Fu, Wenfeng Li, Zhiyong Peng: Sublinear Time Approximate Sum via Uniform Random Sampling CoRR abs/1202.6598: (2012) | |
| 119 | Bin Fu, Wenxin Li, Minghui Wu, Rongfeng Li, Zhuoqun Xu: A Document Rectification Approach Dealing with both Perspective Distortion and Warping Based on Text Flow Curve Fitting. Int. J. Image Graphics 12(1): (2012) | |
| 118 | Bin Fu, Yumei Huo, Hairong Zhao: Coordinated scheduling of production and delivery with production window and delivery capacity constraints. Theor. Comput. Sci. 422: 39-51 (2012) | |
| 2011 | ||
| 117 | Bin Fu, Ding-Zhu Du: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings Springer 2011 | |
| 116 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials. COCOA 2011: 1-15 | |
| 115 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials. COCOA 2011: 16-30 | |
| 114 | Liang Ding, Bin Fu, Binhai Zhu: Minimum Interval Cover and Its Application to Genome Sequencing. COCOA 2011: 287-298 | |
| 113 | Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu: Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA 2011: 299-310 | |
| 112 | Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu: Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments. COCOA 2011: 74-81 | |
| 111 | Zaixin Lu, Wei Zhang, Weili Wu, Bin Fu, Ding-Zhu Du: Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model. ICDCS Workshops 2011: 160-165 | |
| 110 | Bin Fu, Louxin Zhang: A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance. ISBRA 2011: 297-305 | |
| 109 | Julio López, Colin Degraf, Tiziana DiMatteo, Bin Fu, Eugene Fink, Garth A. Gibson: Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations. SSDBM 2011: 546-554 | |
| 108 | Chuanhe Huang, Jia Ye, Bin Fu: Two Sides Approximation Algorithms for Channel Assignments in Wireless Network. WASA 2011: 36-47 | |
| 107 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Discovering almost any hidden motif from multiple sequences. ACM Transactions on Algorithms 7(2): 26 (2011) | |
| 106 | Bin Fu, Matthew J. Patitz, Robert T. Schweller, Bobby Sheline: Self-Assembly with Geometric Tiles CoRR abs/1104.2809: (2011) | |
| 105 | Bin Fu: On the Complexity of Approximate Sum of Sorted List CoRR abs/1112.0520: (2011) | |
| 104 | Bin Fu, Yumei Huo, Hairong Zhao: Approximation schemes for parallel machine scheduling with availability constraints. Discrete Applied Mathematics 159(15): 1555-1565 (2011) | |
| 103 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. Electronic Colloquium on Computational Complexity (ECCC) 18: 28 (2011) | |
| 102 | Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from some nonuniform nondeterministic complexity classes. J. Comb. Optim. 22(3): 482-493 (2011) | |
| 101 | Bin Fu: Theory and application of width bounded geometric separators. J. Comput. Syst. Sci. 77(2): 379-392 (2011) | |
| 100 | Li Chen, Bin Fu: Linear and sublinear time algorithms for the basis of abelian groups. Theor. Comput. Sci. 412(32): 4110-4122 (2011) | |
| 2010 | ||
| 99 | Bin Fu, Yumei Huo, Hairong Zhao: Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. AAIM 2010: 141-149 | |
| 98 | Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu: A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102 | |
| 97 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. COCOA (1) 2010: 309-323 | |
| 96 | Artem Chebotko, Bin Fu: XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. COCOA (2) 2010: 97-106 | |
| 95 | Bin Fu, Lusheng Wang: Constant Time Approximation Scheme for Largest Well Predicted Subset. COCOON 2010: 429-438 | |
| 94 | Liang Ding, Bin Fu, Yunhui Fu: Improved Sublinear Time Algorithm for Width-Bounded Separators. FAW 2010: 101-112 | |
| 93 | Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao: O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. FAW 2010: 250-261 | |
| 92 | Bin Fu, Yumei Huo, Hairong Zhao: Approximation Schemes for Scheduling with Availability Constraints. FAW 2010: 77-88 | |
| 91 | Bin Fu, Kai Ren, Julio López, Eugene Fink, Garth A. Gibson: DiscFinder: a data-intensive scalable cluster finder for astrophysics. HPDC 2010: 348-351 | |
| 90 | Zhongfeng Wang, Zhihai Wang, Bin Fu: Learning Robust Bayesian Network Classifiers in the Space of Markov Equivalent Classes. ICDM Workshops 2010: 891-898 | |
| 89 | Zhongfeng Wang, Zhihai Wang, Bin Fu: Learning Restricted Bayesian Network Classifiers with Mixed Non-i.i.d. Sampling. ICDM Workshops 2010: 899-904 | |
| 88 | Zaixin Lu, Zhiyu Zhao, Bin Fu: Efficient protein alignment algorithm for protein search. BMC Bioinformatics 11(S-1): 34 (2010) | |
| 87 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing CoRR abs/1007.1260: (2010) | |
| 86 | Bin Fu, Yunhui Fu: Sublinear Time Motif Discovery from Multiple Sequences CoRR abs/1007.2618: (2010) | |
| 85 | Artem Chebotko, Bin Fu: XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme CoRR abs/1007.2671: (2010) | |
| 84 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials CoRR abs/1007.2673: (2010) | |
| 83 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials CoRR abs/1007.2675: (2010) | |
| 82 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials CoRR abs/1007.2678: (2010) | |
| 81 | Bin Fu: Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP CoRR abs/1012.2377: (2010) | |
| 80 | Bin Fu: NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets CoRR abs/1012.2394: (2010) | |
| 79 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 114 (2010) | |
| 78 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 122 (2010) | |
| 77 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 124 (2010) | |
| 76 | Bin Fu: NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets. Electronic Colloquium on Computational Complexity (ECCC) 17: 196 (2010) | |
| 75 | Bin Fu: Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 202 (2010) | |
| 74 | Lei Li, Bin Fu, Christos Faloutsos: Efficient Parallel Learning of Hidden Markov Chain Models on SMPs. IEICE Transactions 93-D(6): 1330-1342 (2010) | |
| 73 | Zhixiang Chen, Bin Fu, John Abraham: A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor. J. Comb. Optim. 19(2): 134-157 (2010) | |
| 2009 | ||
| 72 | John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: On the Approximability of Some Haplotyping Problems. AAIM 2009: 3-14 | |
| 71 | Bin Fu, Yumei Huo, Hairong Zhao: Makespan Minimization with Machine Availability Constraints. COCOA 2009: 430-437 | |
| 70 | Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from Some Nonuniform Nondeterministic Complexity Classes. COCOON 2009: 486-495 | |
| 69 | Li Chen, Bin Fu: Linear and Sublinear Time Algorithms for Basis of Abelian Groups. ISAAC 2009: 493-502 | |
| 68 | Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell: Analysis of uncertain data: Selection of probes for information gathering. SMC 2009: 2227-2232 | |
| 67 | Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell: Analysis of uncertain data: Evaluation of given hypotheses. SMC 2009: 2556-2561 | |
| 66 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. TAMC 2009: 231-240 | |
| 65 | Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Krishnakumar Krishnaswamy, Bin Fu: Search Similar protein Structures with Classification, Sequence and 3D alignments. J. Bioinformatics and Computational Biology 7(5): 755-771 (2009) | |
| 64 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) | |
| 63 | Bin Fu, Zhiyu Zhao: Separating sublinear time computations by approximate diameter. J. Comb. Optim. 18(4): 393-416 (2009) | |
| 62 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. SIAM J. Discrete Math. 23(4): 1715-1737 (2009) | |
| 61 | Bin Fu, Yumei Huo, Hairong Zhao: Exponential inapproximability and FPTAS for scheduling with availability constraints. Theor. Comput. Sci. 410(27-29): 2663-2674 (2009) | |
| 2008 | ||
| 60 | Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu: Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. APBC 2008: 333-342 | |
| 59 | Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Bin Fu: New Algorithm and Web Server for Finding Proteins with Similar 3D Structures. BIOCOMP 2008: 674-680 | |
| 58 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 | |
| 57 | Bin Fu, Zhiyu Zhao: Separating Sublinear Time Computations by Approximate Diameter. COCOA 2008: 79-88 | |
| 56 | Bin Fu, Zhixiang Chen: A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. COCOON 2008: 82-91 | |
| 55 | Kaiguo Fan, Weigen Huang, Mingxia He, Bin Fu, Xilin Gan: Simulation Study on the Effect of Wind Direction on SAR Imaging Shallow Water Bathymetry. IGARSS (1) 2008: 409-412 | |
| 54 | Kaiguo Fan, Weigen Huang, Bin Fu, Mingxia He: Simulation Study on the Optimal Conditions for Shallow Water Bathymetry Observation by SAR. IGARSS (1) 2008: 454-457 | |
| 53 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. TAMC 2008: 234-245 | |
| 52 | Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu: Multi-Directional Width-Bounded Geometric Separator and protein Folding. Int. J. Comput. Geometry Appl. 18(5): 389-413 (2008) | |
| 51 | Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Comb. Optim. 15(2): 201-221 (2008) | |
| 50 | Bin Fu, Zhixiang Chen: Sublinear time width-bounded separators and their application to the protein side-chain packing problem. J. Comb. Optim. 15(4): 387-407 (2008) | |
| 49 | Zhiyu Zhao, Bin Fu, Francisco J. Alanis, Christopher M. Summa: Feedback Algorithm and Web-Server for Protein Structure Alignment. Journal of Computational Biology 15(5): 505-524 (2008) | |
| 48 | Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu: Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. Journal of Computational Biology 15(5): 535-546 (2008) | |
| 2007 | ||
| 47 | Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. AAIM 2007: 317-326 | |
| 46 | Zhiyu Zhao, Bin Fu: A Flexible Algorithm for Pairwise Protein Structure Alignment. BIOCOMP 2007: 16-22 | |
| 45 | Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu: Non-breaking Similarity of Genomes with Gene Repetitions. CPM 2007: 119-130 | |
| 44 | Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu: On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. FAW 2007: 160-171 | |
| 43 | Minghui Wu, Rongfeng Li, Bin Fu, Wenxin Li, Zhuoqun Xu: A Page Content Independent Book Dewarping Method to Handle 2D Images Captured by a Digital Camera. ICIAR 2007: 1242-1253 | |
| 42 | Bin Fu, Sai Aravalli, John Abraham: Software Protection by Hardware and Obfuscation. Security and Management 2007: 367-373 | |
| 41 | Li Chen, Bin Fu: Linear and Sublinear Time Algorithms for the Basis of Abelian Groups. Electronic Colloquium on Computational Complexity (ECCC) 14(052): (2007) | |
| 40 | Zhixiang Chen, Bin Fu: On the complexity of Rocchio's similarity-based relevance feedback algorithm. JASIST 58(10): 1392-1400 (2007) | |
| 39 | Zhixiang Chen, Bin Fu: Erratum. JASIST 58(14): 2414 (2007) | |
| 38 | Bin Fu, Wei Wang: Geometric Separators and Their Applications to Protein Folding in the HP-Model. SIAM J. Comput. 37(4): 1014-1029 (2007) | |
| 2006 | ||
| 37 | Bin Fu, Zhixiang Chen: Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. AAIM 2006: 149-160 | |
| 36 | Zhixiang Chen, Bin Fu, Binhai Zhu: The Approximability of the Exemplar Breakpoint Distance Problem. AAIM 2006: 291-302 | |
| 35 | Bin Fu, Golden G. Richard III, Yixin Chen: Some new approaches for preventing software tampering. ACM Southeast Regional Conference 2006: 655-660 | |
| 34 | Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes. COCOON 2006: 245-254 | |
| 33 | Xiulin Lou, Weigen Huang, Bin Fu, Junhua Teng: A Feature-Based Approach for Automatic Registration of NOAA AVHRR Images. IGARSS 2006: 995-998 | |
| 32 | Bin Fu: Theory and Application of Width Bounded Geometric Separator. STACS 2006: 277-288 | |
| 31 | Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu: A PTAS for a disc covering problem using width-bounded separators. J. Comb. Optim. 11(2): 203-217 (2006) | |
| 2005 | ||
| 30 | Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu: A PTAS for a Disc Covering Problem Using Width-Bounded Separators. COCOON 2005: 490-503 | |
| 29 | Zhixiang Chen, Bin Fu: A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. COCOON 2005: 955-964 | |
| 28 | Zhixiang Chen, Bin Fu: On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. ISAAC 2005: 216-225 | |
| 27 | Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu: Multi-directional Width-Bounded Geometric Separator and Protein Folding. ISAAC 2005: 995-1006 | |
| 26 | Bin Fu: Theory and Application of Width Bounded Geometric Separator Electronic Colloquium on Computational Complexity (ECCC)(013): (2005) | |
| 2004 | ||
| 25 | Bin Fu, Wei Wang: A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. ICALP 2004: 630-644 | |
| 24 | Bin Fu, Richard Beigel: Diagnosis in the Presence of Intermittent Faults. ISAAC 2004: 427-441 | |
| 2003 | ||
| 23 | Bin Fu, James Broberg, Zahir Tari: Task Assignment Strategy for Overloaded Systems. ISCC 2003: 1119-1125 | |
| 22 | Bin Fu, Zahir Tari: A Dynamic Load Distribution Strategy for Systems Under High Task Variation and Heavy Traffic. SAC 2003: 1031-1037 | |
| 2000 | ||
| 21 | Richard Beigel, Bin Fu: Circuits over PP and PL. J. Comput. Syst. Sci. 60(2): 422-441 (2000) | |
| 1999 | ||
| 20 | Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. Algorithmica 24(2): 87-95 (1999) | |
| 19 | Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Algorithmica 25(2-3): 222-238 (1999) | |
| 1998 | ||
| 18 | Richard Beigel, Bin Fu: Solving Intractable Problems with DNA Computing. IEEE Conference on Computational Complexity 1998: 154- | |
| 1997 | ||
| 17 | Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. ICALP 1997: 816-826 | |
| 16 | Richard Beigel, Bin Fu: Circuits Over PP and PL. IEEE Conference on Computational Complexity 1997: 24-35 | |
| 15 | Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. ISTCS 1997: 6-11 | |
| 14 | Bin Fu, Keshab K. Parhi: Generalized multiplication-free arithmetic codes. IEEE Transactions on Communications 45(5): 497-501 (1997) | |
| 1995 | ||
| 13 | Bin Fu, Keshab K. Parhi: Two VLSI Design Advances in Arithmetic Coding. ISCAS 1995: 1440-1443 | |
| 12 | Bin Fu, Keshab K. Parhi: Generalized Multiplication Free Arithmetic Codes. ISCAS 1995: 437-440 | |
| 11 | Bin Fu: With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. SIAM J. Comput. 24(5): 1082-1090 (1995) | |
| 1994 | ||
| 10 | Bin Fu, Hong-Zhou Li, Yong Zhong: An Application of the Translational Method. Mathematical Systems Theory 27(2): 183-186 (1994) | |
| 9 | Bin Fu, Hong-Zhou Li: Closeness of NP-Hard Sets to Other Complexity Classes. SIAM J. Comput. 23(2): 255-260 (1994) | |
| 1993 | ||
| 8 | Bin Fu: With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. Structure in Complexity Theory Conference 1993: 185-191 | |
| 7 | Bin Fu: On Lower Bounds of the Closeness Between Complexity Classes. Mathematical Systems Theory 26(2): 187-202 (1993) | |
| 6 | Shouwen Tang, Bin Fu, Tran Liu: Exponential-Time and Subexponential-Time Sets. Theor. Comput. Sci. 115(2): 371-381 (1993) | |
| 5 | Bin Fu, Hong-Zhou Li: On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets. Theor. Comput. Sci. 120(2): 279-291 (1993) | |
| 1992 | ||
| 4 | Bin Fu, Hong-Zhou Li: On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. ISAAC 1992: 439-448 | |
| 3 | Bin Fu, Hong-Zhou Li: On Closeness of NP-Hard Sets to Other Complexity Classes. Structure in Complexity Theory Conference 1992: 243-248 | |
| 2 | Bin Fu, Hong-Zhou Li, Yong Zhong: Some Properties of Exponential Time Complexity Classes. Structure in Complexity Theory Conference 1992: 50-57 | |
| 1991 | ||
| 1 | Shouwen Tang, Bin Fu, Tian Liu: Exponential Time and Subexponential Time Sets. Structure in Complexity Theory Conference 1991: 230-237 | |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page