Graphs (Y. Alavi A. Schwenk ed.) John Wiley and Sons / G. / /
Country
Lithuania / /
Facility
University of Frankfurt / Vilnius University / Stasys Jukna Institute of Computer Science / Germany Institute of Mathematics / /
IndustryTerm
explicit protocol / smallest depth computing / maximum matching algorithm / communication protocol / communication protocols / computing / search procedures / /
Organization
University of Frankfurt / Frankfurt / Germany Institute of Mathematics and Informatics / Vilnius University / Vilnius / Stasys Jukna Institute of Computer Science / /
Person
Alice / Mario Szegedy / Jacobo Tor / Then Bob / / /
Product
Recall / /
ProvinceOrState
Oregon / /
Technology
maximum matching algorithm / previous protocol / explicit protocol / communication protocol / communication protocols / DLL algorithms / /
Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi