Invitation games and the price of stability (Q2988870): Difference between revisions

@@ Property / author @@
-Uriel Feige
@@ Property / author: Uriel Feige / rank @@
-Normal rank
@@ Property / author @@
+Uriel Feige
@@ Property / author: Uriel Feige / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1145/2554797.2554808
+Normal rank
@@ Property / OpenAlex ID @@
+W2059255213
@@ Property / OpenAlex ID: W2059255213 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Bounds for Width Two Branching Programs
@@ Property / cites work: Bounds for Width Two Branching Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
+Normal rank
@@ Property / cites work @@
+(Leveled) fully homomorphic encryption without bootstrapping
+Normal rank
@@ Property / cites work @@
+Efficient Fully Homomorphic Encryption from (Standard) LWE
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
+Normal rank
@@ Property / cites work @@
+Trapdoors for hard lattices and new cryptographic constructions
+Normal rank
@@ Property / cites work @@
+Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
+Normal rank
@@ Property / cites work @@
+Evaluating Branching Programs on Encrypted Data
@@ Property / cites work: Evaluating Branching Programs on Encrypted Data / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
+Normal rank
@@ Property / cites work @@
+Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
+Normal rank
@@ Property / cites work @@
+Public-key cryptosystems from the worst-case shortest vector problem
+Normal rank
@@ Property / cites work @@
+New lattice-based cryptographic constructions
@@ Property / cites work: New lattice-based cryptographic constructions / rank @@
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+A hierarchy of polynomial time lattice basis reduction algorithms
+Normal rank