洛瓦茲·拉茲洛- 維基百科，自由的百科全書
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
László Lovász – Wikipedie
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting – arXiv Vanity
PDF) Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
PDF) Random Graph Isomorphism
PDF) Interactive proofs and the hardness of approximating cliques
László Babai: Hungarian mathematician and computer scientist (1950-) | Biography, Facts, Information, Career, Wiki, Life
PDF) A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
Madhusudan Parthasarathy – Curriculum Vitae
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
PDF) Multiplicative Equations over Commuting Matrices.
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Quanquan C. Liu
48 TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs
László Babai - Wikipedia
PDF) Communication Complexity of Simultaneous Messages
Harald Helfgott - Wikiwand
Quanquan C. Liu
Quanquan C. Liu
Paul Erdős - Wikiwand
Joshua A. Grochow
PDF) Fast Digital Signature Algorithm Based on Subgraph Isomorphism
László Lovász - Wikiwand
PDF) Does co-NP have short interactive proofs?
Evaluating cooperation in communities with the k-core structure
PDF) Algorithm and Experiments in Testing Planar Graphs for Isomorphism
Péter Frankl - Wikiwand
