Find link

language:

Find link is a tool written by Edward Betts.

searching for Innovations in Theoretical Computer Science 22 found (26 total)

alternate case: innovations in Theoretical Computer Science

Chris Umans (594 words) [view diff] exact match in snippet view article find links to article

(2023). "Matrix Multiplication via Matrix Groups". 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl - Leibniz-Zentrum

Henry Cohn (674 words) [view diff] exact match in snippet view article find links to article

(2023). "Matrix Multiplication via Matrix Groups". 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl - Leibniz-Zentrum

Lexicographic dominance (711 words) [view diff] case mismatch in snippet view article find links to article

ordinal preferences". Proceedings of the 5th conference on Innovations in theoretical computer science. ITCS '14. New York, NY, USA: Association for Computing

Toniann Pitassi (990 words) [view diff] exact match in snippet view article find links to article

"Fairness through awareness". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS '12. New York, NY, USA: ACM. pp. 214–226

Fine-grained reduction (831 words) [view diff] exact match in snippet view article find links to article

non-reducibility", ITCS'16—Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ACM, New York, pp. 261–270, MR 3629829

Sensitivity theorem (2,366 words) [view diff] exact match in snippet view article find links to article

Symmetric Group and Beyond (Extended Abstract)". 12th Innovations in Theoretical Computer Science (ITCS) conference. p. 5 pages, 326343 bytes. doi:10.4230/LIPICS

Time-lock puzzle (353 words) [view diff] exact match in snippet view article find links to article

puzzles from randomized encodings." In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pp. 345-356. 2016. v t e

Gödel Prize (2,163 words) [view diff] exact match in snippet view article find links to article

encryption without bootstrapping". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. New York, New York, USA: ACM Press. pp. 309–325

Zvi Lotker (741 words) [view diff] case mismatch in snippet view article find links to article

social networks. In Proceedings of the 2015 conference on innovations in theoretical computer science (pp. 41–50). Alon, N., Avin, C., Koucký, M., Kozma, G

Knaster–Tarski theorem (2,426 words) [view diff] exact match in snippet view article find links to article

Supermodular Games, and the Complexity of Equilibria". 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings

Entitlement (fair division) (2,058 words) [view diff] exact match in snippet view article

(2012-01-08). "No justified complaints". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS '12. New York, NY, USA: Association

Shmuel Onn (1,423 words) [view diff] exact match in snippet view article find links to article

PTAS Results for Scheduling with Setups Times". ITCS - Innovations in Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs)

Strategyproofness (2,611 words) [view diff] case mismatch in snippet view article find links to article

ordinal preferences". Proceedings of the 5th conference on Innovations in theoretical computer science. ITCS '14. New York, NY, USA: Association for Computing

Non-interactive zero-knowledge proof (2,465 words) [view diff] exact match in snippet view article find links to article

of knowledge, and back again". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12. ACM. pp. 326–349. doi:10.1145/2090236

Quasi-polynomial time (1,453 words) [view diff] exact match in snippet view article find links to article

(unbalanced) biclique", in Kalai, Yael Tauman (ed.), 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge

Backtracking line search (4,564 words) [view diff] exact match in snippet view article find links to article

non-isolated critical points and invariant regions". 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (PDF). Leibniz International Proceedings

Communication complexity (6,853 words) [view diff] exact match in snippet view article find links to article

Jiapeng (200). "Lifting with Sunflowers" (PDF). 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Vol. 215. Leibniz International

Oblivious RAM (3,993 words) [view diff] exact match in snippet view article find links to article

lower bound?", Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (ITCS '16), Association for Computing Machinery, pp. 357–368

Reversible cellular automaton (9,018 words) [view diff] exact match in snippet view article find links to article

universal cellular automaton", Proceedings of the 6th Innovations in Theoretical Computer Science Conference (ITCS 2015), Association for Computing Machinery

Efficient approximately fair item allocation (5,471 words) [view diff] exact match in snippet view article find links to article

Welfare, Matrix Permanent, and Stable Polynomials". 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings

Fairness (machine learning) (9,172 words) [view diff] exact match in snippet view article

"Fairness through awareness". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12. pp. 214–226. doi:10.1145/2090236

Parameterized approximation algorithm (3,354 words) [view diff] exact match in snippet view article find links to article

Approximating 2-CSPs and Directed Steiner Network". 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings