The following pages link to Michal Parnas (Q293442):
Displaying 31 items.
- Learning conjunctions with noise under product distributions (Q293443) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- Testing metric properties (Q1877548) (← links)
- The binary rank of circulant block matrices (Q2093516) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- The Boolean rank of the uniform intersection matrix and a family of its submatrices (Q2419048) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Efficient Dynamic Traitor Tracing (Q2706136) (← links)
- Neighborhood Preserving Hashing and Approximate Queries (Q2784503) (← links)
- (Q3128884) (← links)
- On maximal isolation sets in the uniform intersection matrix (Q3300704) (← links)
- Fast Connected Components Algorithms for the EREW PRAM (Q4229421) (← links)
- On Testing Convexity and Submodularity (Q4429680) (← links)
- (Q4440424) (← links)
- Testing of Clustering (Q4443096) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- Testing of Clustering (Q4652253) (← links)
- All-port line broadcasting in highly connected graphs (Q4667718) (← links)
- (Q4780800) (← links)
- (Q4780801) (← links)
- Testing Basic Boolean Formulae (Q4785704) (← links)
- Testing membership in parenthesis languages (Q4798183) (← links)
- (Q4941828) (← links)
- (Q4952673) (← links)
- Circulant almost cross intersecting families (Q5045251) (← links)
- Testing metric properties (Q5175980) (← links)
- (Q5460884) (← links)
- On the binary and Boolean rank of regular matrices (Q6584058) (← links)
