Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAmir Yehudayoff
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j28]Amir Yehudayoff:
Pointer chasing via triangular discrimination. Comb. Probab. Comput. 29(4): 485-494 (2020)- [j27]Shay Moran
, Amir Yehudayoff:
On Weak ε-Nets and the Radon Number. Discret. Comput. Geom. 64(4): 1125-1140 (2020) - [j26]Ofer M. Shir, Amir Yehudayoff:
On the covariance-Hessian relation in evolution strategies. Theor. Comput. Sci. 801: 157-174 (2020) - [c40]Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff:
On the Perceptron's Compression. CiE 2020: 310-325 - [c39]Ido Nachum, Amir Yehudayoff:
On Symmetry and Initialization for Neural Networks. LATIN 2020: 401-412 - [i55]Olivier Bousquet, Steve Hanneke, Shay Moran, Ramon van Handel, Amir Yehudayoff:
A Theory of Universal Learning. CoRR abs/2011.04483 (2020) - [i54]Anup Rao, Amir Yehudayoff:
The Communication Complexity of the Exact Gap-Hamming Problem. Electron. Colloquium Comput. Complex. 27: 6 (2020) - [i53]Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff:
Interactive Proofs for Verifying Machine Learning. Electron. Colloquium Comput. Complex. 27: 58 (2020) - [i52]Pavel Hrubes, Amir Yehudayoff:
Shadows of Newton polytopes. Electron. Colloquium Comput. Complex. 27: 189 (2020)
2010 – 2019
- 2019
- [j25]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Comput. Complex. 28(1): 1-25 (2019) - [c38]Ido Nachum, Amir Yehudayoff:
Average-Case Information Complexity of Learning. ALT 2019: 633-646 - [c37]Daniel Kane, Roi Livni, Shay Moran, Amir Yehudayoff:
On Communication Complexity of Classification Problems. COLT 2019: 1903-1943 - [c36]Shay Moran, Amir Yehudayoff:
On Weak epsilon-Nets and the Radon Number. Symposium on Computational Geometry 2019: 51:1-51:14 - [c35]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. ICALP 2019: 72:1-72:14 - [c34]Stephan Gocht, Jakob Nordström, Amir Yehudayoff:
On Division Versus Saturation in Pseudo-Boolean Solving. IJCAI 2019: 1711-1718 - [c33]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. ITCS 2019: 40:1-40:16 - [c32]Amir Yehudayoff:
Separating monotone VP and VNP. STOC 2019: 425-429 - [i51]Ido Nachum, Amir Yehudayoff:
On Symmetry and Initialization for Neural Networks. CoRR abs/1907.00560 (2019) - [i50]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Electron. Colloquium Comput. Complex. 26: 26 (2019) - 2018
- [j24]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed construction of purely additive spanners. Distributed Comput. 31(3): 223-240 (2018) - [c31]Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff:
Learners that Use Little Information. ALT 2018: 25-55 - [c30]Ido Nachum, Jonathan Shafer, Amir Yehudayoff:
A Direct Sum Result for the Information Complexity of Learning. COLT 2018: 1547-1568 - [i49]Ido Nachum, Jonathan Shafer, Amir Yehudayoff:
A Direct Sum Result for the Information Complexity of Learning. CoRR abs/1804.05474 (2018) - [i48]Ofer M. Shir, Amir Yehudayoff:
On the Covariance-Hessian Relation in Evolution Strategies. CoRR abs/1806.03674 (2018) - [i47]Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff:
On the Perceptron's Compression. CoRR abs/1806.05403 (2018) - [i46]Ido Nachum, Amir Yehudayoff:
Average-Case Information Complexity of Learning. CoRR abs/1811.09923 (2018) - [i45]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. 25: 31 (2018) - [i44]Amir Yehudayoff:
Separating Monotone VP and VNP. Electron. Colloquium Comput. Complex. 25: 124 (2018) - [i43]Amir Yehudayoff:
Anti-concentration in most directions. Electron. Colloquium Comput. Complex. 25: 194 (2018) - 2017
- [j23]Amir Yehudayoff:
An Elementary Exposition of Topological Overlap in the Plane. Discret. Comput. Geom. 58(2): 255-264 (2017) - [c29]Ofer M. Shir, Amir Yehudayoff:
On the Statistical Learning Ability of Evolution Strategies. FOGA 2017: 127-138 - [c28]Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff:
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. NIPS 2017: 1656-1665 - [i42]Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff:
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. CoRR abs/1705.08430 (2017) - [i41]Shay Moran, Amir Yehudayoff:
On weak $ε$-nets and the Radon number. CoRR abs/1707.05381 (2017) - [i40]Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff:
Learners that Leak Little Information. CoRR abs/1710.05233 (2017) - [i39]Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff:
A learning problem that is independent of the set theory ZFC axioms. CoRR abs/1711.05195 (2017) - [i38]Daniel M. Kane, Roi Livni, Shay Moran, Amir Yehudayoff:
On Communication Complexity of Classification Problems. CoRR abs/1711.05893 (2017) - [i37]Daniel M. Kane, Roi Livni, Shay Moran, Amir Yehudayoff:
On Communication Complexity of Classification Problems. Electron. Colloquium Comput. Complex. 24: 177 (2017) - 2016
- [j22]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero-Error Average Communication. Algorithmica 76(3): 782-795 (2016) - [j21]Shay Moran, Amir Yehudayoff:
Sample Compression Schemes for VC Classes. J. ACM 63(3): 21:1-21:10 (2016) - [j20]Avi Wigderson, Amir Yehudayoff:
Population recovery and partial identification. Mach. Learn. 102(1): 29-56 (2016) - [j19]Shay Moran, Amir Yehudayoff:
A Note on Average-Case Sorting. Order 33(1): 23-28 (2016) - [c27]Noga Alon, Shay Moran, Amir Yehudayoff:
Sign rank versus VC dimension. COLT 2016: 47-80 - [c26]Ofer M. Shir, Jonathan Roslund, Amir Yehudayoff:
On the Capacity of Evolution Strategies to Statistically Learn the Landscape. GECCO (Companion) 2016: 151-152 - [c25]Pavel Hrubes, Amir Yehudayoff:
On Isoperimetric Profiles and Computational Complexity. ICALP 2016: 89:1-89:12 - [c24]Shay Moran, Amir Yehudayoff:
Sample compression schemes for VC classes. ITA 2016: 1-14 - [c23]Ofir David, Shay Moran, Amir Yehudayoff:
Supervised learning through the lens of compression. NIPS 2016: 2784-2792 - [c22]Shay Moran, Makrand Sinha, Amir Yehudayoff:
Fooling Pairs in Randomized Communication Complexity. SIROCCO 2016: 49-59 - [c21]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. DISC 2016: 129-142 - [i36]Ofer M. Shir, Jonathan Roslund, Amir Yehudayoff:
On the Theoretical Capacity of Evolution Strategies to Statistically Learn the Landscape Hessian. CoRR abs/1606.07262 (2016) - [i35]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. CoRR abs/1607.05597 (2016) - [i34]Ofir David, Shay Moran, Amir Yehudayoff:
On statistical learning via the lens of compression. CoRR abs/1610.03592 (2016) - [i33]Amir Yehudayoff:
Pointer chasing via triangular discrimination. Electron. Colloquium Comput. Complex. 23: 151 (2016) - 2015
- [c20]Balthazar Bauer, Shay Moran, Amir Yehudayoff:
Internal Compression of Protocols to Entropy. APPROX-RANDOM 2015: 481-496 - [c19]Anup Rao, Amir Yehudayoff:
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. Computational Complexity Conference 2015: 88-101 - [c18]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Compressing and Teaching for Low VC-Dimension. FOCS 2015: 40-51 - [i32]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. CoRR abs/1502.06187 (2015) - [i31]Shay Moran, Amir Yehudayoff:
Proper PAC learning is compressing. CoRR abs/1503.06960 (2015) - [i30]David Ellis, Ehud Friedgut, Guy Kindler, Amir Yehudayoff:
Geometric stability via information theory. CoRR abs/1510.00258 (2015) - [i29]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. Electron. Colloquium Comput. Complex. 22: 25 (2015) - [i28]Shay Moran, Amir Yehudayoff:
Proper PAC learning is compressing. Electron. Colloquium Comput. Complex. 22: 40 (2015) - [i27]Pavel Hrubes, Amir Yehudayoff:
On isoperimetric profiles and computational complexity. Electron. Colloquium Comput. Complex. 22: 164 (2015) - 2014
- [j18]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. 43(3): 973-986 (2014) - [c17]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. ICALP (1) 2014: 701-712 - [c16]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct sum fails for zero error average communication. ITCS 2014: 517-522 - [i26]Parikshit Gopalan, Amir Yehudayoff:
Inequalities and tail bounds for elementary symmetric polynomial. CoRR abs/1402.3543 (2014) - [i25]Parikshit Gopalan, Amir Yehudayoff:
Inequalities and tail bounds for elementary symmetric polynomials. Electron. Colloquium Comput. Complex. 21: 19 (2014) - [i24]Shay Moran, Makrand Sinha, Amir Yehudayoff:
Fooling Pairs in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. 21: 22 (2014) - [i23]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Electron. Colloquium Comput. Complex. 21: 46 (2014) - [i22]Anup Rao, Amir Yehudayoff:
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. Electron. Colloquium Comput. Complex. 21: 60 (2014) - [i21]Balthazar Bauer, Shay Moran, Amir Yehudayoff:
Internal compression of protocols to entropy. Electron. Colloquium Comput. Complex. 21: 101 (2014) - [i20]Noga Alon, Shay Moran, Amir Yehudayoff:
Sign rank, VC dimension and spectral gaps. Electron. Colloquium Comput. Complex. 21: 135 (2014) - 2013
- [j17]Ron Peled, Wojciech Samotij, Amir Yehudayoff:
Lipschitz Functions on Expanders are Typically Flat. Comb. Probab. Comput. 22(4): 566-591 (2013) - [j16]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9: 283-293 (2013) - [c15]Pavel Hrubes, Amir Yehudayoff:
Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting. Computational Complexity Conference 2013: 10-14 - [c14]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. FOCS 2013: 746-755 - [c13]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Product via Round-Preserving Compression. ICALP (1) 2013: 232-243 - [i19]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct product via round-preserving compression. Electron. Colloquium Comput. Complex. 20: 35 (2013) - [i18]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero Error Average Communication. Electron. Colloquium Comput. Complex. 20: 79 (2013) - [i17]Shay Moran, Amir Yehudayoff:
A note on average-case sorting. Electron. Colloquium Comput. Complex. 20: 106 (2013) - 2012
- [j15]Amir Yehudayoff:
Linear cover time for trees is exponentially unlikely. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j14]Amir Yehudayoff:
Proving expansion in three steps. SIGACT News 43(3): 67-84 (2012) - [c12]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. FOCS 2012: 390-399 - [c11]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction access. ITCS 2012: 19-33 - [c10]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. STOC 2012: 615-624 - [c9]Jean Bourgain, Amir Yehudayoff:
Monotone expansion. STOC 2012: 1061-1078 - [i16]Pavel Hrubes, Amir Yehudayoff:
Formulas are exponentially stronger than monotone circuits in non-commutative setting. Electron. Colloquium Comput. Complex. 19: 61 (2012) - [i15]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. Electron. Colloquium Comput. Complex. 19: 118 (2012) - [i14]Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff:
Direct Products in Communication Complexity. Electron. Colloquium Comput. Complex. 19: 143 (2012) - 2011
- [j13]Pavel Hrubes, Amir Yehudayoff:
Homogeneous Formulas and Symmetric Polynomials. Comput. Complex. 20(3): 559-578 (2011) - [j12]Amir Yehudayoff:
Affine extractors over prime fields. Comb. 31(2): 245-256 (2011) - [j11]Ran Raz, Amir Yehudayoff:
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77(1): 167-190 (2011) - [j10]Ron Peled, Ariel Yadin, Amir Yehudayoff:
The maximal probability that k-wise independent bits are all 1. Random Struct. Algorithms 38(4): 502-525 (2011) - [j9]Pavel Hrubes, Amir Yehudayoff:
Arithmetic Complexity in Ring Extensions. Theory Comput. 7(1): 119-129 (2011) - [c8]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 - [i13]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. Electron. Colloquium Comput. Complex. 18: 134 (2011) - [i12]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction Access. Electron. Colloquium Comput. Complex. 18: 160 (2011) - 2010
- [j8]Amir Shpilka, Amir Yehudayoff:
Arithmetic Circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5(3-4): 207-388 (2010) - [c7]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Relationless Completeness and Separations. Computational Complexity Conference 2010: 280-290 - [c6]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. FOCS 2010: 40-47 - [c5]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Non-commutative circuits and the sum-of-squares problem. STOC 2010: 667-676 - [i11]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) - [i10]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Non-commutative circuits and the sum-of-squares problem. Electron. Colloquium Comput. Complex. 17: 21 (2010) - [i9]Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff:
Pseudorandom Generators for Regular Branching Programs. Electron. Colloquium Comput. Complex. 17: 35 (2010) - [i8]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Relationless completeness and separations. Electron. Colloquium Comput. Complex. 17: 40 (2010) - [i7]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. 17: 149 (2010)
2000 – 2009
- 2009
- [j7]Ran Raz, Amir Yehudayoff:
Lower Bounds and Separations for Constant Depth Multilinear Circuits. Comput. Complex. 18(2): 171-207 (2009) - [j6]Pavel Hrubes, Amir Yehudayoff:
Monotone separations for constant degree polynomials. Inf. Process. Lett. 110(1): 1-3 (2009) - [j5]Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff:
Players' Effects Under Limited Independence. Math. Oper. Res. 34(4): 971-980 (2009) - [j4]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. SIAM J. Comput. 39(4): 1279-1293 (2009) - [i6]Pavel Hrubes, Amir Yehudayoff:
Homogeneous formulas and symmetric polynomials. CoRR abs/0907.2621 (2009) - [i5]Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. 16: 70 (2009) - 2008
- [j3]Ran Raz, Amir Yehudayoff:
Balancing Syntactically Multilinear Arithmetic Circuits. Comput. Complex. 17(4): 515-535 (2008) - [j2]Ronen Gradwohl, Amir Yehudayoff:
t-Wise independence with local dependencies. Inf. Process. Lett. 106(5): 208-212 (2008) - [j1]Ran Raz, Amir Shpilka, Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. SIAM J. Comput. 38(4): 1624-1647 (2008) - [c4]Ran Raz, Amir Yehudayoff:
Lower Bounds and Separations for Constant Depth Multilinear Circuits. Computational Complexity Conference 2008: 128-139 - [c3]Ran Raz, Amir Yehudayoff:
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. FOCS 2008: 273-282 - [c2]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. STOC 2008: 741-748 - [i4]Ran Raz, Amir Yehudayoff:
Lower Bounds and Separations for Constant Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. 15(006) (2008) - 2007
- [c1]Ran Raz, Amir Shpilka, Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. FOCS 2007: 438-448 - [i3]Ran Raz, Amir Yehudayoff:
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. Electron. Colloquium Comput. Complex. 14(085) (2007) - [i2]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. Electron. Colloquium Comput. Complex. 14(121) (2007) - 2006
- [i1]Ran Raz, Amir Shpilka, Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. 13(060) (2006)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-01-21 22:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
