default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeev Dvir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Manik Dhar, Zeev Dvir, Ben Lund
:
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg-Erman Proof. Discret. Comput. Geom. 71(2): 327-357 (2024)- [j34]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. TheoretiCS 3 (2024) - 2022
- [j33]Zeev Dvir, Avishay Tal:
Guest Editors' Foreword to the CCC 2020 Special Issue. Theory Comput. 18: 1-4 (2022) - [c31]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. FOCS 2022: 419-428 - [i58]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. CoRR abs/2204.01665 (2022) - [i57]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [j32]Stijn Cambie, Bogdan Chornomaz, Zeev Dvir, Yuval Filmus, Shay Moran:
A Sauer-Shelah-Perles Lemma for Lattices. Electron. J. Comb. 27(4): 4 (2020) - [j31]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49(3): 465-496 (2020) - [j30]Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices are Not Rigid. Theory Comput. 16: 1-48 (2020)
2010 – 2019
- 2019
- [j29]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. Discret. Comput. Geom. 61(4): 778-808 (2019) - [j28]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. Theory Comput. 15: 1-24 (2019) - [j27]Zeev Dvir, Benjamin L. Edelman:
Matrix Rigidity and the Croot-Lev-Pach Lemma. Theory Comput. 15: 1-7 (2019) - [c30]Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices Are Not Rigid. CCC 2019: 17:1-17:23 - [c29]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS 2019: 32:1-32:20 - [c28]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static data structure lower bounds imply rigidity. STOC 2019: 967-978 - [i56]Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices are Not Rigid. CoRR abs/1902.07334 (2019) - [i55]Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices are Not Rigid. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j26]Zeev Dvir, Shay Moran:
A Sauer-Shelah-Perles Lemma for Sumsets. Electron. J. Comb. 25(4): 4 (2018) - [i54]Zeev Dvir, Shay Moran:
A Sauer-Shelah-Perles Lemma for Sumsets. CoRR abs/1806.05737 (2018) - [i53]Zeev Dvir, Sivakanth Gopi, Avi Wigderson:
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR abs/1809.10372 (2018) - [i52]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static Data Structure Lower Bounds Imply Rigidity. CoRR abs/1811.02725 (2018) - [i51]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static Data Structure Lower Bounds Imply Rigidity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j25]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. Theory Comput. 13(1): 1-36 (2017) - [c27]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. SoCG 2017: 15:1-15:15 - [c26]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. ITCS 2017: 20:1-20:19 - [i50]Zeev Dvir, Benjamin L. Edelman:
Matrix rigidity and the Croot-Lev-Pach lemma. CoRR abs/1708.01646 (2017) - 2016
- [j24]Zeev Dvir, David Zuckerman:
Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. Comput. Complex. 25(2): 305-307 (2016) - [j23]Jean Bourgain, Zeev Dvir, Ethan Leeman:
Affine extractors over large fields with exponential error. Comput. Complex. 25(4): 921-931 (2016) - [j22]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for linear 2-query LCCs over finite fields. Comb. 36(1): 1-36 (2016) - [j21]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. Discret. Comput. Geom. 56(4): 940-965 (2016) - [j20]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with Subpolynomial Communication. J. ACM 63(4): 39:1-39:15 (2016) - [i49]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw distributions and locally decodable codes. CoRR abs/1609.06355 (2016) - [i48]Zeev Dvir, Ankit Garg, Rafael Oliveira, József Solymosi:
Rank bounds for design matrices with block entries and geometric applications. CoRR abs/1610.08923 (2016) - [i47]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the number of ordinary lines determined by sets in complex space. CoRR abs/1611.08740 (2016) - 2015
- [j19]Zeev Dvir, Christian Tessier-Lavigne:
A Quantitative Variant of the Multi-colored Motzkin-Rabin Theorem. Discret. Comput. Geom. 53(1): 38-47 (2015) - [c25]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. SoCG 2015: 29-43 - [c24]Zeev Dvir, Sivakanth Gopi:
On the Number of Rich Lines in Truly High Dimensional Sets. SoCG 2015: 584-598 - [c23]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with Sub-Polynomial Communication. STOC 2015: 577-584 - 2014
- [j18]Zeev Dvir, János Kollár, Shachar Lovett:
Variety Evasive Sets. Comput. Complex. 23(4): 509-529 (2014) - [j17]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Bounds for Matching Vector Families. SIAM J. Comput. 43(5): 1654-1683 (2014) - [c22]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. ICALP (1) 2014: 259-270 - [c21]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. ICALP (1) 2014: 417-428 - [c20]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCC's over the reals. STOC 2014: 784-793 - [i46]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. CoRR abs/1401.3714 (2014) - [i45]Jean Bourgain, Zeev Dvir, Ethan Leeman:
Affine extractors over large fields with exponential error. CoRR abs/1401.6189 (2014) - [i44]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDC. CoRR abs/1402.6952 (2014) - [i43]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with sub-polynomial communication. CoRR abs/1407.6692 (2014) - [i42]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. CoRR abs/1412.0795 (2014) - [i41]Zeev Dvir, Sivakanth Gopi:
On the number of rich lines in truly high dimensional sets. CoRR abs/1412.1060 (2014) - [i40]Jean Bourgain, Zeev Dvir, Ethan Leeman:
Affine extractors over large fields with exponential error. Electron. Colloquium Comput. Complex. TR14 (2014) - [i39]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i38]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with sub-polynomial communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i37]Zeev Dvir, Rafael Oliveira:
Factors of Sparse Polynomials are Sparse. Electron. Colloquium Comput. Complex. TR14 (2014) - [i36]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j16]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. SIAM J. Comput. 42(6): 2305-2328 (2013) - [j15]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9: 283-293 (2013) - [c19]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs over Large Modulo. APPROX-RANDOM 2013: 513-526 - [c18]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New bounds for matching vector families. STOC 2013: 823-832 - [i35]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs Over Large Modulo. CoRR abs/1304.4819 (2013) - [i34]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. CoRR abs/1311.5102 (2013) - [i33]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs Over Large Modulo. Electron. Colloquium Comput. Complex. TR13 (2013) - [i32]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j14]Zeev Dvir:
Extractors for varieties. Comput. Complex. 21(4): 515-572 (2012) - [j13]Zeev Dvir:
Incidence Theorems and Their Applications. Found. Trends Theor. Comput. Sci. 6(4): 257-393 (2012) - [c17]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction access. ITCS 2012: 19-33 - [c16]Zeev Dvir, Shachar Lovett:
Subspace evasive sets. STOC 2012: 351-358 - [c15]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. STOC 2012: 615-624 - [i31]Zeev Dvir, János Kollár, Shachar Lovett:
Variety Evasive Sets. CoRR abs/1203.4532 (2012) - [i30]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Lower Bounds for Matching Vector Codes. CoRR abs/1204.1367 (2012) - [i29]Zeev Dvir:
Incidence Theorems and Their Applications. CoRR abs/1208.5073 (2012) - [i28]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs/1211.0330 (2012) - [i27]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. CoRR abs/1211.0331 (2012) - [i26]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i25]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Lower Bounds for Matching Vector Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i24]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j12]Zeev Dvir:
On Matrix Rigidity and Locally Self-correctable Codes. Comput. Complex. 20(2): 367-388 (2011) - [j11]Zeev Dvir, Amir Shpilka:
Towards dimension expanders over finite fields. Comb. 31(3): 305-320 (2011) - [j10]Zeev Dvir, Avi Wigderson:
Kakeya Sets, New Mergers, and Old Extractors. SIAM J. Comput. 40(3): 778-792 (2011) - [j9]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. SIAM J. Comput. 40(4): 1154-1178 (2011) - [j8]Zeev Dvir, Amir Shpilka:
Noisy Interpolating Sets for Low-Degree Polynomials. Theory Comput. 7(1): 1-18 (2011) - [c14]Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf:
Tight Lower Bounds for 2-query LCCs over Finite Fields. FOCS 2011: 638-647 - [c13]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475 - [c12]Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson:
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. STOC 2011: 519-528 - [i23]Zeev Dvir, Shachar Lovett:
Subspace Evasive Sets. CoRR abs/1110.5696 (2011) - [i22]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for 2-query LCCs over finite fields. Electron. Colloquium Comput. Complex. TR11 (2011) - [i21]Zeev Dvir, Shachar Lovett:
Subspace Evasive Sets. Electron. Colloquium Comput. Complex. TR11 (2011) - [i20]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. Electron. Colloquium Comput. Complex. TR11 (2011) - [i19]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction Access. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j7]Zeev Dvir, Avi Wigderson:
Monotone Expanders: Constructions and Applications. Theory Comput. 6(1): 291-308 (2010) - [c11]Zeev Dvir:
On Matrix Rigidity and Locally Self-Correctable Codes. CCC 2010: 291-298 - [c10]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. FOCS 2010: 705-714 - [i18]Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. CoRR abs/1009.4375 (2010) - [i17]Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i16]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. TR10 (2010) - [i15]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j6]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors And Rank Extractors For Polynomial Sources. Comput. Complex. 18(1): 1-58 (2009) - [j5]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. SIAM J. Comput. 39(4): 1279-1293 (2009) - [j4]Zeev Dvir:
Guest column: from randomness extraction to rotating needles. SIGACT News 40(4): 46-61 (2009) - [c9]Zeev Dvir:
Extractors for Varieties. CCC 2009: 102-113 - [c8]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. FOCS 2009: 181-190 - [i14]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. TR09 (2009) - [i13]Zeev Dvir:
From Randomness Extraction to Rotating Needles. Electron. Colloquium Comput. Complex. TR09 (2009) - [i12]Zeev Dvir:
On matrix rigidity and locally self-correctable codes. Electron. Colloquium Comput. Complex. TR09 (2009) - [i11]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i10]Zeev Dvir, Avi Wigderson:
Monotone expanders - constructions and applications. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j3]Zeev Dvir, Ran Raz:
Analyzing linear mergers. Random Struct. Algorithms 32(3): 334-345 (2008) - [c7]Zeev Dvir, Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials. CCC 2008: 140-148 - [c6]Zeev Dvir, Amir Shpilka:
Towards Dimension Expanders over Finite Fields. CCC 2008: 304-310 - [c5]Zeev Dvir, Avi Wigderson:
Kakeya Sets, New Mergers and Old Extractors. FOCS 2008: 625-633 - [c4]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. STOC 2008: 741-748 - [i9]Zeev Dvir:
Deterministic Extractors for Algebraic Sources. Electron. Colloquium Comput. Complex. TR08 (2008) - [i8]Zeev Dvir, Amir Shpilka:
Noisy Interpolating Sets for Low Degree Polynomials. Electron. Colloquium Comput. Complex. TR08 (2008) - [i7]Zeev Dvir, Avi Wigderson:
Kakeya sets, new mergers and old extractors. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j2]Zeev Dvir, Amir Shpilka:
An Improved Analysis of Linear Mergers. Comput. Complex. 16(1): 34-59 (2007) - [j1]Zeev Dvir, Amir Shpilka:
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. SIAM J. Comput. 36(5): 1404-1434 (2007) - [c3]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. FOCS 2007: 52-62 - [i6]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. Electron. Colloquium Comput. Complex. TR07 (2007) - [i5]Zeev Dvir, Amir Shpilka:
Towards Dimension Expanders Over Finite Fields. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR07 (2007) - 2005
- [c2]Zeev Dvir, Amir Shpilka:
An Improved Analysis of Mergers. APPROX-RANDOM 2005: 270-281 - [c1]Zeev Dvir, Amir Shpilka:
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. STOC 2005: 592-601 - [i3]Zeev Dvir, Ran Raz:
Analyzing Linear Mergers. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Zeev Dvir, Amir Shpilka:
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Zeev Dvir, Amir Shpilka:
An Improved Analysis of Mergers. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
