Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Claudia Bertram‐Kretzberg
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
MODp‐tests, almost independence and small probability spaces
2000
Claudia Bertram‐Kretzberg
Hanno Lefmann
+
PDF
Chat
MODp-tests, almost independence and small probability spaces
2000
Claudia Bertram‐Kretzberg
Hanno Lefmann
+
Proper Bounded Edge-Colorings
1998
Claudia Bertram‐Kretzberg
Hanno Lefmann
Vojtěch Rödl
Beata Wysocka
+
PDF
Chat
MODp-tests, almost independence and small probability spaces
1997
Claudia Bertram‐Kretzberg
Hanno Lefmann
+
Multiple Product Modulo Arbitrary Numbers
1995
Claudia Bertram‐Kretzberg
Thomas Hofmeister
Common Coauthors
Coauthor
Papers Together
Hanno Lefmann
4
Beata Wysocka
1
Vojtěch Rödl
1
Thomas Hofmeister
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
A fast and simple randomized parallel algorithm for the maximal independent set problem
1986
Noga Alon
László Babai
Alon Itai
2
+
Irregularities of Distribution
1987
József Beck
William Chen
2
+
Approximating Probability Distributions Using Small Sample Spaces
1998
Yossi Azar
Rajeev Motwani
Joseph Naor
2
+
Approximations of general independent distributions
1992
Guy Even
Oded Goldreich
Michael Luby
Noam Nisan
Boban Veličković
2
+
PDF
Chat
Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC
1991
Bonnie Berger
John Rompel
2
+
PDF
Chat
Simple Constructions of Almost k‐wise Independent Random Variables
1992
Noga Alon
Oded Goldreich
Johan Håstad
René Peralta
2
+
Quasi-random graphs
1989
Fan Chung
Ronald Graham
R. Wilson
2
+
Ramanujan graphs
1988
Alexander Lubotzky
Ralph S. Phillips
Peter Sarnak
2
+
Extremal uncrowded hypergraphs
1982
Miklós Ajtai
János Komlós
J. Pintz
J. Spencer
Endre Szemerédi
1
+
Efficient approximation of product distributions
1998
Guy Even
Oded Goldreich
Michael Luby
Noam Nisan
Boban Veli kovi
1
+
Turán's theorem for k-graphs
1972
Joel Spencer
1
+
Improved Algorithms via Approximations of Probability Distributions
2000
Suresh Chari
Pankaj Rohatgi
Aravind Srinivasan
1
+
Multicolored Subsets in Colored Hypergraphs
1996
Hanno Lefmann
Vojtěch Rödl
Beata Wysocka
1
+
On the power of two-point based sampling
1989
Benny Chor
Oded Goldreich
1
+
ϵ-discrepancy sets and their application for interpolation of sparse polynomials
1995
Noga Alon
Yishay Mansour
1
+
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
1988
Prabhakar Raghavan
1