Tzvi Alon

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	A faster FPTAS for counting two-rowed contingency tables	2020	Tzvi Alon Nir Halman
+	Fully polynomial time approximation schemes (FPTAS) for some counting problems	2016	Tzvi Alon

Common Coauthors

Coauthor	Papers Together
Nir Halman	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Sampling contingency tables	1997	Martin Dyer Ravi Kannan John Mount	2
+	Polynomial-time counting and sampling of two-rowed contingency tables	2000	Martin Dyer Catherine Greenhill	2
+	Approximate counting by dynamic programming	2003	Martin Dyer	2
+	A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy	2016	Nir Halman	2
+ PDF Chat	A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions	2012	Daniel Štefankovič Santosh Vempala Eric Vigoda	2
+	Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs	2010	Parikshit Gopalan Adam R. Klivans Raghu Meka	2
+	Counting independent sets up to the tree threshold	2006	Dror Weitz	1
+	Approximately Counting Hamilton Paths and Cycles in Dense Graphs	1998	Martin Dyer Alan Frieze Mark Jerrum	1
+ PDF Chat	Pseudorandom generators for polynomial threshold functions	2010	Raghu Meka David Zuckerman	1
+ PDF Chat	Testing for Independence in a Two-Way Table: New Interpretations of the Chi-Square Statistic	1985	Persi Diaconis Bradley Efron	1
+ PDF Chat	Approximating the Permanent	1989	Mark Jerrum Alistair Sinclair	1
+	A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph	1995	Mark Jerrum	1
+	A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries	2004	Mark Jerrum Alistair Sinclair Eric Vigoda	1
+	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows	2006	Mary Cryan Martin Dyer Leslie Ann Goldberg Mark Jerrum Russell Martin	1
+ PDF Chat	Faster FPTASes for Counting and Random Generation of Knapsack Solutions	2014	Roméo Rizzi Alexandru I. Tomescu	1
+ PDF Chat	2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011)	2011	Yevgeniy Dodis Xin Li Trevor D. Wooley David Zuckerman	1
+	Approximate Counting Scheme for m × n Contingency Tables	2004	Shuji Kijima Tomomi Matsui	1
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2003	Mary Cryan Martin Dyer	1
+	Approximating convex functions via non-convex oracles under the relative noise model	2015	Nir Halman	1
+	An FPTAS for #Knapsack and Related Counting Problems	2011	Parikshit Gopalan Adam R. Klivans Raghu Meka Daniel tefankovic Santosh Vempala Eric Vigoda	1
+ PDF Chat	Simple deterministic approximation algorithms for counting matchings	2007	Mohsen Bayati David Gamarnik Dimitriy Katz Chandra Nair Prasad Tetali	1
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2002	Mary Cryan Martin Dyer	1
+	On the number of Eulerian orientations of a graph	1996	Milena Mihail P. Winkler	1