Items where authors include "Peng, P."

Article

Bossek, J., Neumann, F., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2021) Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem. Algorithmica, 83. pp. 3148-3179. ISSN 0178-4617

Ge, Y., Peng, P. and Lu, H. orcid.org/0000-0002-0349-2181 (2021) Mixed-order spectral clustering for complex networks. Pattern Recognition, 117. 107964. ISSN 0031-3203

Egiyan, H, Ehrhart, M, El Alaoui, A et al. (90 more authors) (2020) Beam–target helicity asymmetry E in K+Σ− photoproduction on the neutron. Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics. 135662. ISSN 0370-2693

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2020) Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics (SIDMA), 34 (1). pp. 130-162. ISSN 0895-4801

Dey, T.K., Peng, P. orcid.org/0000-0003-2700-5699, Rossi, A. et al. (1 more author) (2019) Spectral concentration and greedy k-clustering. Computational Geometry, 76. pp. 19-32. ISSN 0925-7721

Huang, Z. and Peng, P. orcid.org/0000-0003-2700-5699 (2018) Dynamic graph stream algorithms in o(n) space. Algorithmica. ISSN 0178-4617

Ho, D., Peng, P., Bass, C. et al. (145 more authors) (2017) Beam-Target Helicity Asymmetry for γ (over-right-arrow) n (over-right-arrow) → π − p in the N* Resonance Region. Physical Review Letters. 242002. ISSN 1079-7114

Bedlinskiy, I., Kubarovsky, V., Stoler, P. et al. (144 more authors) (2017) Exclusive eta electroproduction at W > 2 GeV with CLAS and transversity generalized parton distributions. Physical Review C. 035202. ISSN 2469-9993

Bosted, P. E., Biselli, A. S., Careccia, S. et al. (160 more authors) (2016) Target and beam-target spin asymmetries in exclusive pi(+) and pi(-) electroproduction with 1.6-to 5.7-GeV electrons. Physical Review C. 055201. ISSN 2469-9993

Zheng, X., Adhikari, K. P., Bosted, P. et al. (149 more authors) (2016) Measurement of target and double-spin asymmetries for the e→p→eπ+(n) reaction in the nucleon resonance region at low Q(2). Physical Review C. 045206. ISSN 2469-9993

Paterson, C. A., Ireland, D. G., Livingston, K. et al. (130 more authors) (2016) Photoproduction of Lambda and Sigma(0) hyperons using linearly polarized photons. Physical Review C. 065201. ISSN 2469-9993

Senderovich, I., Morrison, B. T., Dugger, M. et al. (147 more authors) (2016) First measurement of the helicity asymmetry E in eta photoproduction on the proton. Physics Letters B. pp. 64-69. ISSN 0370-2693

Peng, P., Lekadir, K., Gooya, A. et al. (3 more authors) (2016) A review of heart chamber segmentation for structural and functional analysis using cardiac magnetic resonance imaging. Magnetic Resonance Materials in Physics, Biology and Medicine, 29 (2). pp. 155-195. ISSN 0968-5243

Proceedings Paper

Peng, P. orcid.org/0000-0003-2700-5699 and Zhang, J. (2021) Towards a query-optimal and time-efficient algorithm for clustering with a faulty oracle. In: Proceedings of the 34th Annual Conference on Learning Theory (COLT 2021). 34th Annual Conference on Learning Theory (COLT 2021), 15-19 Aug 2021, Boulder, Colorado. Proceedings of Machine Learning Research (134). PMLR .

Peng, P. orcid.org/0000-0003-2700-5699, Lopatta, D., Yoshida, Y. et al. (1 more author) (2021) Local algorithms for estimating effective resistance. In: KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 14-18 Aug 2021, Virtual conference Singapore. ACM Digital Library , pp. 1329-1338. ISBN 9781450383325

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) GSF-locality is not sufficient for proximity-oblivious testing. In: Kabanets, V., (ed.) 36th Computational Complexity Conference (CCC 2021). Computational Complexity Conference (CCC), 20-22 Jul 2021, Virtual conference (Toronto, Ontario, Cananda). Leibniz International Proceedings in Informatics (LIPIcs), 200 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 34:1-34:27. ISBN 9783959771931

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) On testability of first-order properties in bounded-degree graphs. In: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '21: ACM-SIAM Symposium on Discrete Algorithms, 10-13 Jan 2021, Virginia, Virtual Event. Association for Computing Machinery (ACM) , pp. 1578-1597. ISBN 9781611976465

Manghiuc, B.-A., Peng, P. orcid.org/0000-0003-2700-5699 and Sun, H. (2020) Augmenting the algebraic connectivity of graphs. In: Grandoni, F., Herman, G. and Sanders, P., (eds.) 28th Annual European Symposium on Algorithms (ESA 2020). 28th European Symposium on Algorithms (ESA 2020), 07-10 Sep 2020, Online conference. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl--Leibniz-Zentrum fur Informatik , 70:1-70:22. ISBN 9783959771627

Czumaj, A., Fichtenberger, H., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2020) Testable properties in general graphs and random order streaming. In: Byrka, J. and Meka, R., (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). 24th International Conference on Randomization and Computation (RANDOM 2020), 17-19 Aug 2020, Online conference. Leibniz International Proceedings in Informatics (LIPIcs) (176). Schloss Dagstuhl--Leibniz-Zentrum fur Informatik , 16:1-16:20. ISBN 9783959771641

Peng, P. orcid.org/0000-0003-2700-5699 and Yoshida, Y. (2020) Average sensitivity of spectral clustering. In: KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. The 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2020), 23-27 Aug 2020, Virtual Event, CA, USA. Association for Computing Machinery (ACM) , pp. 1132-1140. ISBN 9781450379984

Fichtenberger, H., Gao, M. and Peng, P. (2020) Sampling arbitrary subgraphs exactly uniformly in sublinear time. In: Czumaj, A., Dawar, A. and Merelli, E., (eds.) The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020). The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), 08-11 Jul 2020, Saarbrücken, Germany. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 45:1-45:13. ISBN 9783959771382

Bossek, J., Neumann, F., Peng, P. et al. (1 more author) (2020) More effective randomized search heuristics for graph coloring through dynamic optimization. In: GECCO 2020: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2020 : Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Cancún, Mexico. ACM Digital Library , pp. 1277-1285. ISBN 9781450371285

Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2020) Constant-time dynamic (∆+1)-coloring. In: Paul, C. and Bläser, M., (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. LIPIcs, 154 . Schloss Dagstuhl – Leibniz Center for Informatics , 53:1-53:18. ISBN 9783959771405

Peng, P. orcid.org/0000-0003-2700-5699 (2020) Robust clustering oracle and local reconstructor of cluster structure of graphs. In: Chawla, S., (ed.) 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020). 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 05-08 Jan 2020, Salt Lake City, Utah, USA. SIAM Proceedings . Society for Industrial and Applied Mathematics (SIAM) . ISBN 9781611975994

Bossek, J., Neumann, F., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2019) Runtime analysis of randomized search heuristics for dynamic graph coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 19). Genetic and Evolutionary Computation Conference (GECCO '19), 13-17 Jul 2019, Prague, Czech Republic. ACM , pp. 1443-1451. ISBN 9781450361118

Fichtenberger, H., Peng, P. orcid.org/0000-0003-2700-5699 and Sohler, C. (2019) Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In: Chan, T., (ed.) Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19). 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19), 06-09 Jan 2019, San Diego, California. SIAM . ISBN 978-1-61197-548-2

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2018) Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. In: Proceedings of the 26th European Symposium on Algorithms (ESA 2018). The 26th European Symposium on Algorithms (ESA 2018), 20-22 Aug 2018, Helsinki, Finland. LIPIcs, 112 (40). Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Germany . ISBN 978-3-95977-081-1

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2017) Improved guarantees for Vertex Sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms (ESA 2017). 25th Annual European Symposium on Algorithms (ESA 2017), 04-08 Sep 2017, Vienna, Austria. Leibniz International Proceedings in Informatics, 87 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 44:1-44:14. ISBN 978-3-95977-049-1

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2017) The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms (ESA 2017). 25th Annual European Symposium on Algorithms (ESA 2017), 04-08 Sep 2017, Vienna, Austria. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 45:1-45:14. ISBN 978-3-95977-049-1

Monemizadeh, M., Muthukrishnan, S., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2017) Testable bounded degree graph properties are random order streamable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F. and Muscholl, A., (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. ICALP 2017, 10-14 Jul 2017, Warsaw, Poland. LIPIcs, 80 . Dagstuhl Publishing , Dagstuhl, Germany , 131:1-131:14. ISBN 9783959770415

Czumaj, A., Peng, P. orcid.org/0000-0003-2700-5699 and Sohler, C. (2015) Testing cluster structure of graphs. In: STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. STOC '15: Symposium on Theory of Computing, 14-17 Jun 2015, Portland, Oregon, USA. Association for Computing Machinery (ACM) , pp. 723-732. ISBN 9781450335362