![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Alexander Lubotzky
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Yotam Dikstein, Irit Dinur, Alexander Lubotzky:
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. CoRR abs/2402.01078 (2024) - [i11]Yotam Dikstein, Irit Dinur, Alexander Lubotzky:
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. Electron. Colloquium Comput. Complex. TR24 (2024) - 2022
- [c9]Irit Dinur
, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes:
Locally testable codes with constant rate, distance, and locality. STOC 2022: 357-374 - [i10]Oren Becker, Alexander Lubotzky, Jonathan Mosheiff
:
Testability in group theory. CoRR abs/2204.04539 (2022) - [i9]Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes:
Good Locally Testable Codes. CoRR abs/2207.11929 (2022) - 2021
- [c8]Oren Becker, Alexander Lubotzky, Jonathan Mosheiff
:
Testability of relations between permutations. FOCS 2021: 286-297 - [i8]Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes:
Locally Testable Codes with constant rate, distance, and locality. CoRR abs/2111.04808 (2021) - [i7]Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes:
Locally Testable Codes with constant rate, distance, and locality. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i6]Oren Becker, Alexander Lubotzky, Jonathan Mosheiff:
Stability and testability: equations in permutations. CoRR abs/2011.05234 (2020)
2010 – 2019
- 2019
- [j8]Alexander Lubotzky
, Zur Luria
, Ron Rosenthal:
Random Steiner systems and bounded degree coboundary expanders of every dimension. Discret. Comput. Geom. 62(4): 813-831 (2019) - 2018
- [j7]Alexander Lubotzky
, Zur Luria, Ron Rosenthal:
On groups and simplicial complexes. Eur. J. Comb. 70: 408-444 (2018) - 2017
- [i5]Shai Evra, Emmanuel Kowalski, Alexander Lubotzky:
Good cyclic codes and the uncertainty principle. CoRR abs/1703.01080 (2017) - 2014
- [c7]Tali Kaufman, David Kazhdan, Alexander Lubotzky
:
Ramanujan Complexes and Bounded Degree Topological Expanders. FOCS 2014: 484-493 - [c6]Tali Kaufman, Alexander Lubotzky
:
High dimensional expanders and property testing. ITCS 2014: 501-506 - [i4]Tali Kaufman, David Kazhdan, Alexander Lubotzky:
Ramanujan Complexes and bounded degree topological expanders. CoRR abs/1408.6351 (2014) - [i3]Tali Kaufman, David Kazhdan, Alexander Lubotzky:
Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders. CoRR abs/1409.1397 (2014) - 2013
- [i2]Tali Kaufman, Alexander Lubotzky:
High Dimensional Expanders and Property Testing. CoRR abs/1312.2367 (2013) - 2012
- [j6]Alexander Lubotzky
, Chen Meiri:
Sieve Methods in Group Theory III: Aut(FN). Int. J. Algebra Comput. 22(7) (2012) - [c5]Tali Kaufman, Alexander Lubotzky
:
Edge transitive ramanujan graphs and symmetric LDPC good codes. STOC 2012: 359-366 - 2011
- [i1]Tali Kaufman, Alexander Lubotzky:
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes. CoRR abs/1108.2960 (2011)
2000 – 2009
- 2005
- [j5]Alexander Lubotzky
, Beth Samuels, Uzi Vishne
:
Explicit constructions of Ramanujan complexes of type Ãd. Eur. J. Comb. 26(6): 965-993 (2005) - 2003
- [j4]Miklós Abért, Alexander Lubotzky
, László Pyber:
Bounded Generation and Linear Groups. Int. J. Algebra Comput. 13(4): 401-413 (2003) - 2001
- [c4]Noga Alon, Alexander Lubotzky
, Avi Wigderson:
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. FOCS 2001: 630-637
1990 – 1999
- 1998
- [j3]Alexander Lubotzky
, Tatiana Nagnibeda
:
Not Every Uniform Tree Covers Ramanujan Graphs. J. Comb. Theory B 74(2): 202-212 (1998) - 1994
- [b1]Alexander Lubotzky:
Discrete groups, expanding graphs and invariant measures. Progress in mathematics 125, Birkhäuser 1994, ISBN 978-0-8176-5075-9, pp. I-XI, 1-195 - 1992
- [c3]Alexander Lubotzky, Benjamin Weiss:
Groups and Expanders. Expanding Graphs 1992: 95-109 - 1990
- [j2]Alexander Lubotzky
:
Locally Symmetric Graphs of Prescribed Girth and Coxeter Groups. SIAM J. Discret. Math. 3(2): 277-280 (1990) - [c2]László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky
, Ákos Seress:
On the Diameter of Finite Groups. FOCS 1990: 857-865
1980 – 1989
- 1988
- [j1]Alexander Lubotzky
, Ralph Phillips, Peter Sarnak:
Ramanujan graphs. Comb. 8(3): 261-277 (1988) - 1986
- [c1]Alexander Lubotzky
, Ralph Phillips, Peter Sarnak:
Explicit Expanders and the Ramanujan Conjectures. STOC 1986: 240-246
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-10 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint