The following pages link to Miklós Ajtai (Q684397):
Displaying 50 items.
- The influence of large coalitions (Q684398) (← links)
- (Q1054719) (redirect page) (← links)
- \(\Sigma_ 1^ 1\)-formulae on finite structures (Q1054720) (← links)
- Sorting in \(c \log n\) parallel steps (Q1056541) (← links)
- On optimal matchings (Q1056968) (← links)
- A lower bound for finding predecessors in Yao's cell probe model (Q1112590) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- Worst-case complexity, average-case complexity and lattice problems (Q1126836) (← links)
- A note on Ramsey numbers (Q1149967) (← links)
- A dense infinite Sidon sequence (Q1159234) (← links)
- Extremal uncrowded hypergraphs (Q1164072) (← links)
- The longest path in a random graph (Q1166543) (← links)
- Largest random component of a k-cube (Q1166544) (← links)
- On Turan's theorem for sparse graphs (Q1167183) (← links)
- On a class of finite lattices (Q1215514) (← links)
- On the boundedness of definable linear operators (Q1217705) (← links)
- There is no fast single hashing algorithm (Q1255322) (← links)
- First-order definability on finite structures (Q1263576) (← links)
- (Q1342860) (redirect page) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- Recursive construction for 3-regular expanders (Q1343165) (← links)
- The complexity of the pigeonhole principle (Q1343166) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Determinism versus nondeterminism for linear time RAMs with memory restrictions (Q1869934) (← links)
- Improved Algorithms and Analysis for Secretary Problems and Generalizations (Q2706186) (← links)
- The independence of the modulo <i>p</i> counting principles (Q2817631) (← links)
- Determinism versus non-determinism for linear time RAMs (extended abstract) (Q2819593) (← links)
- Oblivious RAMs without cryptogrpahic assumptions (Q2875144) (← links)
- (Q3002761) (← links)
- (Q3002791) (← links)
- Isomorphism and higher order equivalence (Q3050425) (← links)
- (Q3318963) (← links)
- Construction of a Thin Set with small Fourier Coefficients (Q3360240) (← links)
- Compactly encoding unstructured inputs with differential compression (Q3455534) (← links)
- Reachability is harder for directed than for undirected finite graphs (Q3489984) (← links)
- An Architecture for Provably Secure Computation (Q3525747) (← links)
- Approximate counting of inversions in a data stream (Q3579234) (← links)
- The invasiveness of off-line memory checking (Q3579241) (← links)
- A conjecture about polynomial time computable lattice-lattice functions (Q3580992) (← links)
- The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice (Q3581274) (← links)
- Representing hard lattices with O(n log n) bits (Q3581417) (← links)
- Sorting and Selection with Imprecise Comparisons (Q3638022) (← links)
- (Q3698835) (← links)
- Hash functions for priority queues (Q3719870) (← links)
- The Set of Continuous Functions with the Everywhere Convergent Fourier Series (Q3770542) (← links)
- Monotone versus positive (Q3778681) (← links)
- Sorting in Average Time $o(\log \,n)$ (Q3827548) (← links)
- (Q3906644) (← links)
- (Q3950589) (← links)
- (Q3956992) (← links)
