On the public citation graph

Efficient construction of a small hitting set for combinatorial rectangles in high dimension

https://doi.org/10.1007/bf01200907

0 signed · 62 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1993.1014openalex-snapshot

Approximating the Number of Zeroes of a GF[2] Polynomial

inferredcites →https://doi.org/10.1007/bf01271266openalex-snapshot

Inclusion-exclusion: Exact and approximate

inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot

Pseudorandom generators for space-bounded computation

inferredcites →https://doi.org/10.1007/bf01940870openalex-snapshot

Simulating BPP using a general weak random source

inferredcites →https://doi.org/10.1007/bf01940873openalex-snapshot

On deterministic approximation of DNF

inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot

Universal classes of hash functions

inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot

Explicit constructions of linear-sized superconcentrators

inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot

Expanders, randomness, or time versus space

inferredcites →https://doi.org/10.1016/0885-064x(89)90015-0openalex-snapshot

On the power of two-point based sampling

inferredcites →https://doi.org/10.1109/istcs.1993.253488openalex-snapshot

Deterministic approximate counting of depth-2 circuits

inferredcites →https://doi.org/10.1109/sfcs.1996.548500openalex-snapshot

Discrepancy sets and pseudorandom generators for combinatorial rectangles

inferredcites →https://doi.org/10.1137/0215047openalex-snapshot

Constructing $O(n\log n)$ Size Monotone Formulae for the k th Threshold Function of n Boolean Variables

inferredcites →https://doi.org/10.1137/0219054openalex-snapshot

The Spatial Complexity of Oblivious k -Probe Hash Functions

inferredcites →https://doi.org/10.1145/28395.28410openalex-snapshot

Deterministic simulation in LOGSPACE

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.2001.1776openalex-snapshot

Perfect Information Leader Election in log*n+O(1) Rounds

inferred← citeshttps://doi.org/10.1007/11776420_45openalex-snapshot

Active Sampling for Multiple Output Identification

inferred← citeshttps://doi.org/10.1007/3-540-45071-8_20openalex-snapshot

Finding Hidden Independent Sets in Interval Graphs

inferred← citeshttps://doi.org/10.1007/3-540-46691-6_22openalex-snapshot

A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles

inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot

Derandomization in Combinatorial Optimization

inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_16openalex-snapshot

Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?

inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_30openalex-snapshot

Recursive Methods for Some Problems in Coding and Random Permutations

inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_13openalex-snapshot

Almost Optimal Cover-Free Families

inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_36openalex-snapshot

Optimal Hitting Sets for Combinatorial Shapes

inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_45openalex-snapshot

Pseudorandomness for Regular Branching Programs via Fourier Analysis

inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_46openalex-snapshot

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints

inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot

Introduction to special issue on randomized and derandomized algorithms

inferred← citeshttps://doi.org/10.1007/bfb0023475openalex-snapshot

Efficient constructions of Hitting Sets for systems of linear functions

inferred← citeshttps://doi.org/10.1007/s00037-012-0036-6openalex-snapshot

Pseudorandom Generators for Combinatorial Checkerboards

inferred← citeshttps://doi.org/10.1007/s00145-021-09405-zopenalex-snapshot

Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?

inferred← citeshttps://doi.org/10.1007/s00453-022-00943-xopenalex-snapshot

Deterministic Constructions of High-Dimensional Sets with Small Dispersion

inferred← citeshttps://doi.org/10.1007/s00454-023-00496-yopenalex-snapshot

A Note on Stabbing Convex Bodies with Points, Lines, and Flats

inferred← citeshttps://doi.org/10.1007/s004930200021openalex-snapshot

Improved Pseudorandom Generators for Combinatorial Rectangles

inferred← citeshttps://doi.org/10.1007/s10994-007-5026-6openalex-snapshot

Active sampling for multiple output identification

inferred← citeshttps://doi.org/10.1016/j.jco.2020.101483openalex-snapshot

Expected dispersion of uniformly distributed points

inferred← citeshttps://doi.org/10.1016/j.jco.2020.101522openalex-snapshot

Improved dispersion bounds for modified Fibonacci lattices

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00475-1openalex-snapshot

A lower bound for the hitting set size for combinatorial rectangles and an application

inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00163-5openalex-snapshot

Low discrepancy sets yield approximate min-wise independent permutation families

inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00422-5openalex-snapshot

Finding hidden independent sets in interval graphs

inferred← citeshttps://doi.org/10.1109/ccc.2012.20openalex-snapshot

Hitting Set Generators for Sparse Polynomials over Any Finite Fields

inferred← citeshttps://doi.org/10.1109/cdc.2010.5718129openalex-snapshot

The use of ergodic theory in designing dynamics for search problems

inferred← citeshttps://doi.org/10.1109/focs.2012.77openalex-snapshot

Better Pseudorandom Generators from Milder Pseudorandom Restrictions

inferred← citeshttps://doi.org/10.1109/focs.2015.60openalex-snapshot

Pseudorandomness via the Discrete Fourier Transform

inferred← citeshttps://doi.org/10.1109/focs.2018.00015openalex-snapshot

Simple Optimal Hitting Sets for Small-Success RL

inferred← citeshttps://doi.org/10.1109/sfcs.1996.548500openalex-snapshot

Discrepancy sets and pseudorandom generators for combinatorial rectangles

inferred← citeshttps://doi.org/10.1109/sfcs.1998.743508openalex-snapshot

Perfect information leader election in log*n+O(1) rounds

inferred← citeshttps://doi.org/10.1134/s1990478911030161openalex-snapshot

An entropy addition rule for underdetermined data

inferred← citeshttps://doi.org/10.1137/090764190openalex-snapshot

Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions

inferred← citeshttps://doi.org/10.1137/16m1062132openalex-snapshot

Pseudorandomness via the Discrete Fourier Transform

inferred← citeshttps://doi.org/10.1137/s0895480192228140openalex-snapshot

Constructing Small Sample Spaces Satisfying Given Constraints

inferred← citeshttps://doi.org/10.1145/1536414.1536502openalex-snapshot

Explicit construction of a small epsilon-net for linear threshold functions

inferred← citeshttps://doi.org/10.1145/275487.275494openalex-snapshot

Tight bounds for 2-dimensional indexing schemes

inferred← citeshttps://doi.org/10.1201/9781420011296.ch18openalex-snapshot

Parallel Algorithms via the Probabilistic Method

inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot

CHAPTER NOTES AND REFERENCES

inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot

Chapter 8 Notes and References

inferred← citeshttps://doi.org/10.1561/0400000010openalex-snapshot

Pseudorandomness

inferred← citeshttps://doi.org/10.1561/0400000109openalex-snapshot

Paradigms for Unconditional Pseudorandom Generators

inferred← citeshttps://doi.org/10.4086/toc.2013.v009a013openalex-snapshot

inferred← citeshttps://doi.org/10.4086/toc.2020.v016a017openalex-snapshot

inferred← citeshttps://doi.org/10.48550/arxiv.1506.04350openalex-snapshot

Pseudorandomness via the discrete Fourier transform

inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot

Chapter Notes and References

inferred← citeshttps://doi.org/10.5555/1314498.1314560openalex-snapshot

Behavioral Shaping for Geometric Concepts

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.