• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 143 matches

• 2020
• 
  Michael Chapman, Nati Linial, Yuval Peled:
  Expander Graphs - Both Local and Global. Comb. 40(4): 473-509 (2020)
• 
  Gergely Harcos, Daniel Soltész:
  New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs. Comb. 40(3): 435-454 (2020)
• 
  Ahad N. Zehmakan:
  Opinion forming in Erdős-Rényi random graph and expanders. Discret. Appl. Math. 277: 280-290 (2020)
• 
  Jong Yoon Hyun, Jungyun Lee, Yoonjin Lee:
  Ramanujan graphs and expander families constructed from p-ary bent functions. Des. Codes Cryptogr. 88(2): 453-470 (2020)
• 
  Michael Dinitz, Michael Schapira, Gal Shahaf:
  Approximate Moore Graphs are good expanders. J. Comb. Theory, Ser. B 141: 240-263 (2020)
• 
  Matthew Jenssen, Peter Keevash, Will Perkins:
  Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49(4): 681-710 (2020)
• 
  Netanel Raviv, Itzhak Tamo, Rashish Tandon, Alexandros G. Dimakis:
  Gradient Coding From Cyclic MDS Codes and Expander Graphs. IEEE Trans. Inf. Theory 66(12): 7475-7489 (2020)
• 
  Nobutaka Shimizu, Takeharu Shiraga:
  Quasi-Majority Functional Voting on Expander Graphs. ICALP 2020: 97:1-97:19
• 
  Peter Michael Reichstein Rasmussen, Amit Sahai:
  Expander Graphs Are Non-Malleable Codes. ITC 2020: 6:1-6:10
• 
  Nobutaka Shimizu, Takeharu Shiraga:
  Quasi-majority Functional Voting on Expander Graphs. CoRR abs/2002.07411 (2020)
• 
  Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
  The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR abs/2005.02369 (2020)
• 
  Endre Csóka, Lukasz Grabowski:
  On directed analogues of expander and hyperfinite graph sequences. CoRR abs/2008.08680 (2020)
• 
  Marc Roth, Johannes Schmitt, Philip Wellnitz:
  Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR abs/2011.03433 (2020)
• 2019
• 
  Weizhi Lu, Weiyu Li, Wei Zhang, Shu-Tao Xia:
  Expander Recovery Performance of Bipartite Graphs With Girth Greater Than 4. IEEE Trans. Signal Inf. Process. over Networks 5(3): 418-427 (2019)
• 
  Benny Applebaum, Eliran Kachlon:
  Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. FOCS 2019: 171-179
• 
  Michael Chapman, Nati Linial, Yuval Peled:
  Expander Graphs - Both Local and Global. FOCS 2019: 158-170
• 
  Matthew Jenssen, Peter Keevash, Will Perkins:
  Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247
• 
  Andreas Galanis, Leslie Ann Goldberg, James Stewart:
  A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR abs/1901.06653 (2019)
• 
  Dengwang Tang, Vijay G. Subramanian:
  Derandomized Load Balancing using Random Walks on Expander Graphs. CoRR abs/1901.09094 (2019)
• 
  Eustrat Zhupa, Monika K. Polak:
  Keyed hash function from large girth expander graphs. CoRR abs/1903.06267 (2019)
• 
  Benny Applebaum, Eliran Kachlon:
  Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Electron. Colloquium Comput. Complex. 26: 11 (2019)
• 2018
• 
  Mohamad Badaoui:
  G-graphs and Expander graphs. (G-graphes et les graphes d'expansion). Normandy University, France, 2018
• 
  Mohamad Badaoui, Alain Bretto, David Ellison, Bassam Mourad:
  On constructing expander families of G-graphs. Ars Math. Contemp. 15(2): 425-440 (2018)
• 
  Brett Hemenway, Rafail Ostrovsky:
  Efficient robust secret sharing from expander graphs. Cryptogr. Commun. 10(1): 79-99 (2018)
• 
  Neelav Dutta, David Jensen:
  Gonality of expander graphs. Discret. Math. 341(9): 2535-2543 (2018)
• 
  Ming-Deh Huang, Lian Liu:
  Generating sets for the multiplicative groups of algebras over finite fields and expander graphs. J. Symb. Comput. 85: 170-187 (2018)
• 
  Michael Krivelevich:
  Finding and Using Expanders in Locally Sparse Graphs. SIAM J. Discret. Math. 32(1): 611-623 (2018)
• 
  Moumita Chatterjee, S. K. Setua:
  Gossip-Based Real-Time Task Scheduling Using Expander Graph. ACSS (1) 2018: 3-14
• 
  Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
  Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) 2018: 243-272
• 
  Ameya Prabhu, Girish Varma, Anoop M. Namboodiri:
  Deep Expander Networks: Efficient Deep Networks from Graph Theory. ECCV (13) 2018: 20-36

skipping 113 more matches