Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MORGAN PRIOR:
All reports by Author Morgan Prior:

TR26-325 | 21st November 2026
Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii, Morgan Prior

On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages

Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theoretic garbling, is a model for non-interactive secure computation. Each party encodes its input using shared randomness and sends a message to an evaluator who does not know that randomness. The evaluator must recover the function output ... more >>>


TR25-143 | 26th September 2025
Vladimir Podolskii, Morgan Prior

Alternation Depth of Threshold Decision Lists

Linear decision lists are a computational model for Boolean functions built from a sequence of linear threshold function queries. Each query is evaluated in order: if a query returns true, the list outputs the value of the function, and if the answer is false, the process continues to the next ... more >>>


TR25-068 | 23rd May 2025
Dale Jacobs, John Jeang, Vladimir Podolskii, Morgan Prior, Ilya Volkovich

Communication Complexity of Equality and Error Correcting Codes

We study the randomized communication complexity of the equality function in the public-coin model. Although the communication complexity of this function is known to be low in the setting where error probability is constant and a large number of random bits are available to players, the complexity grows if the ... more >>>




ISSN 1433-8092 | Imprint