Result 1 to 20 of 718 total
The de Bruijn-Erdős theorem for hypergraphs. (English)
Des. Codes Cryptography 65, No. 3, 233-245 (2012).
1
Almost $k$-wise vs. $k$-wise independent permutations, and uniformity for general group actions. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 350-361 (2012).
2
Bayesian ignorance. (English)
Theor. Comput. Sci. 452, 1-11 (2012).
3
Local correction of juntas. (English)
Inf. Process. Lett. 112, No. 6, 223-226 (2012).
4
Dense uniform hypergraphs have high list chromatic number. (English)
Discrete Math. 312, No. 14, 2119-2125 (2012).
5
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels. (English)
J. Comb. Theory, Ser. A 119, No. 6, 1200-1215 (2012).
6
Nonnegative $k$-sums, fractional covers, and probability of small deviations. (English)
J. Comb. Theory, Ser. B 102, No. 3, 784-796 (2012).
7
A non-linear lower bound for planar epsilon-nets. (English)
Discrete Comput. Geom. 47, No. 2, 235-244 (2012).
8
Multicolored matchings in hypergraphs. (English)
Mosc. J. Comb. Number Theory 1, No. 1, 3-10 (2011).
9
Local rainbow colorings. (English)
J. Comb. 2, No. 2, 293-304 (2011).
10
Pragmatic self-stabilization of atomic memory in message-passing systems. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 19-31 (2011).
11
Solving MAX-$r$-SAT above a tight lower bound. (English)
Algorithmica 61, No. 3, 638-655 (2011).
12
Beeping a maximal independent set. (English)
Peleg, David (ed.), Distributed computing. 25th international symposium, DISC 2011, Rome, Italy, September 20‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24099-7/pbk). Lecture Notes in Computer Science 6950, 32-50 (2011).
13
Sparse balanced partitions and the complexity of subgraph problems. (English)
SIAM J. Discrete Math. 25, No. 2, 631-644 (2011).
14
Hypergraph list coloring and Euclidean Ramsey theory. (English)
Random Struct. Algorithms 39, No. 3, 377-390 (2011).
15
On graphs and algebraic graphs that do not contain cycles of length 4. (English)
J. Graph Theory 68, No. 2, 91-102 (2011).
16
Many random walks are faster than one. (English)
Comb. Probab. Comput. 20, No. 4, 481-502 (2011).
17
MIS on the fly. (English)
Comput. Res. Repos. 2011, Article No. 1106.2126 (2011).
18
On sunflowers and matrix multiplication. (English)
Electron. Colloq. Comput. Complex. 18, 67 (2011).
19
Almost k-wise vs. K-wise independent permutations, and uniformity for general group actions. (English)
Electron. Colloq. Comput. Complex. 18, 49 (2011).
20
Result 1 to 20 of 718 total
Start
Contact
Print
General Help
