Main Menu
- About
- People
- People Details
- DIMACS Members
- Pennock, David
- Wang, Kangning
- Powell, Warren
- Dobkin, David
- Drineas, Petros
- Rabin, Tal
- Duffield, Nick
- Dvir, Zeev
- Rajagopal, Gunaretnam
- Eckstein, Jonathan
- Rajagopalan, Sivaram
- Eiger, Martin
- Randall, Dana
- El Rouayheb, Salim
- Elsayed, Elsayed A.
- Erickson, John
- Etessami, Kousha
- Reiman, Marty
- Fagin, Ronald
- Farach-Colton, Martin
- Fefferman, Nina
- Feigenbaum, Joan
- Resende, Mauricio G. C.
- Fiorini, Eugene
- Retakh, Vladimir
- Rexford, Jennifer
- Fortnow, Lance Jeremy
- Fortune, Steven
- Roberts, Fred S.
- Roetteler, Martin
- Fredman, Michael
- Rosenstein, Joseph G.
- Rubenstein, Daniel
- Rubin, Avi
- Rubinfeld, Ronitt
- Ruszczynski, Andrzej
- Garay, Juan
- Garey, Michael
- Gear, C. William
- Saks, Michael
- Gennaro, Rosario
- Saniee, Iraj
- Gentry, Craig
- Sarnak, Peter
- Sarwate, Anand
- Gilman, Robert
- Savari, Serap
- Gindikin, Simon
- Schapire, Rob
- Schieber, Baruch
- Goldberg, Mark K.
- Goldfarb, Don
- Schulzrinne, Henning
- Goldin, Gerald
- Sedgewick, Robert
- Goyal, Vineet
- Sen, Siddhartha
- Servedio, Rocco
- Greenfield, Stephen
- Seymour, Paul
- Shallcross, David
- Gruteser, Marco
- Shelah, Saharon
- Gundy, Richard
- Shepherd, F. Bruce
- Gunluk, Oktay
- Gurvich, Vladimir
- Shor, Peter
- Haber, Stuart
- Hajiaghayi, Mohammad Taghi
- Sills, Andrew
- Abe, Naoki
- Benhamouda, Fabrice
- Halevi, Shai
- Singh, Jaswinder
- Singh, Mona
- Hirsh, Haym
- Sloane, Neil J. A.
- Ho, Tin Kam
- Soffer, Avraham
- Soifer, Alexander
- Soljanin, Emina
- Hoover, Donald
- Sontag, Eduardo
- Horesh, Lior
- Sorkin, Gregory
- Horesh, Raya
- Souvaine, Diane
- Spasojevic, Predrag
- Hsu, Daniel
- Squillante, Mark
- Hung, Ying
- Hwang, Frank
- Iyengar, Garud
- Steiger, William
- Jacobson, Guy
- Steiglitz, Ken
- Stein, Cliff
- Jaggard, Aaron
- Stolovitzky, Gustavo
- Jalali, Shirin
- Strauss, Martin
- Strawderman, William
- Jebara, Tony
- Jeong, Myong K.
- Szegedy, Mario
- Jutla, Charanjit
- Szemeredi, Endre
- Kahn, Jeffry
- Tan, Zhiqiang
- Kalagnanam, Jayant
- Tarjan, Robert
- Kalantari, Bahman
- Tetali, Prasad
- Kale, Satyen
- Thathachar, T.S. Jayram
- Kannan, Sampath
- Thomas, Simon
- Kantor, Paul B.
- Thorup, Mikkel
- Karloff, Howard
- Trappe, Wade
- Katehakis, Michael
- Trotter, Tom
- Troyanskaya, Olga
- Kettenring, Jon
- Tulino, Antonia
- Khanna, Sanjeev
- Khot, Subash
- Vaishampayan, Vinay
- van den Berg, Eric
- Klappholz, David
- Van Wijngaarden, Adriaan
- Klawe, Maria
- Vanderbei, Robert J.
- Kodialam, Murali
- Vasconcelos, Wolmer
- Kogan, Alexander
- Vazirani, Vijay
- Kolaitis, Phokion
- Vempala, Santosh
- Kolassa, John
- Kolesnikov, Vladimir
- Vigoda, Eric
- Komlos, Janos
- Kopparty, Swastik
- Wallace, William
- Krawczyk, Hugo
- Wang, Wendy Hui
- Kushnir, Dan
- Wetzel, Susanne
- White, Christopher
- Lakshman, T. V.
- Whitt, Ward
- Landwehr, Jim
- Wigderson, Avi
- LaPaugh, Andrea
- Wiggins, Chris
- Latka, Brenda
- Wilfong, Gordon
- Lebowitz, Joel
- LeCun, Yann
- Winkler, Peter
- Lee, Jon
- Wortman Vaughan, Jenn
- Wright, Rebecca
- Lesniak, Linda
- Levin, Simon Asher
- Xiao, Han
- Xie, Minge
- Xiong, Hui
- Li, Yi
- Yannakakis, Mihalis
- Aho, Alfred
- Liberty, Edo
- Yao, Andrew
- Yao, Danfeng
- Alizadeh, Farid
- Yao, David
- Allender, Eric
- Lindqvist, Janne
- Lipton, Richard
- Yates, Roy
- Alur, Rajeev
- Amdeberhan, Tewodros
- Littman, Michael L.
- Andrews, Matthew
- Yu, Chun-Nam
- Applegate, David
- Liu, Regina
- Apte, Chidanand (Chid)
- Zeilberger, Doron
- Archer, Aaron
- Llorca, Jaime
- Zhang, Lisa
- Arora, Sanjeev
- Lovasz, Laci
- Ashikhmin, Alexei
- Lozano, Aurelie
- Axelrod, David
- Lu, Yingdong
- Bajwa, Waheed U.
- Lund, Carsten
- Zonouz, Saman Aliari
- Luo, Feng
- Andoni, Alexandr
- De, Subhajyoti
- Lyons, Richard
- Lattime, Edmund
- Barahona, Francisco
- Basu Roy, Senjuti
- Barg, Alexander
- Anshelevich, Elliot
- Baryshnikov, Yuliy
- Madigan, David
- Triandopoulos, Nikos
- Mohajeri, Atefeh
- Baykal-Gursoy, Melike
- Beck, Jozsef
- Malkevitch, Joseph
- Saraf, Shubhangi
- Awasthi, Pranjal
- Malkin, Tal
- Bekris, Kostas
- Mallows, Colin
- Bernstein, Aaron
- Mammone, Richard
- Assadi, Sepehr
- Bader, David
- Bellovin, Steve
- Phan, Hai
- Ben-Israel, Adi
- Slivkins, Alex
- Bentley, Jon
- Maxemchuk, Nick
- Ye, Xinyue
- Wu, Chase
- Berry, Jonathan
- Mili, Ali
- Calvin, James M.
- Bhatt, Sandeep
- Megiddo, Nimrod
- Borcea, Cristian
- Bienstock, Dan
- Mehri Dehnavi, Maryam
- Shih, Frank
- Bishop, Allison
- Melamed, Benjamin
- Ding, Xiaoning
- Wang, Grace Guiling
- Blei, David
- Metaxas, Dimitris
- Li, Jing
- Miasnikov, Alexei
- Wei, Zhi
- Bombieri, Enrico
- Mihail, Milena
- Wang, David
- Minsky, Naftaly
- Xu, Pan
- Borgida, Alexander
- Geller, James
- Borgs, Christian
- Mischaikow, Konstantin
- Musialski, Przem
- Boros, Endre
- Misra, Vishal
- Koutis, Ioannis
- Borst, Sem C.
- Mitra, Debasis
- Curtmola, Reza
- Monma, Clyde
- Kapadia, Mubbasir
- Cuello, William
- Braverman, Mark
- Muthukrishnan, S. (Muthu)
- Faenza, Yuri
- Buchsbaum, Adam L.
- Bumby, Richard
- Najafizadeh, Laleh
- Roughgarden, Tim
- Calderbank, Robert
- Namjoshi, Kedar
- Weinberg, Matt
- Carbone, Lisa J.
- Nannicini, Giacomo
- Gao, Jie
- Naor, Assaf
- Zhang, Linjun
- Narain, Sanjai
- Wang, Guanyang
- Chaintreau, Augustin
- Sharma, Shantanu
- Wei, Hua
- Nath, Badri
- Wang, Jason
- Chang, Shih-Fu
- Naumann, David
- Upadhyay, Jalaj
- Chaovalitwongse, Wanpracha
- Naus, Joseph
- Srikanta, Karthik
- Charikar, Moses
- Gürbüzbalaban, Mert
- Chayes, Jennifer
- Pazour, Jennifer
- Chazelle, Bernard
- Ness, Linda
- Centeno, Ana Paula
- Chekuri, Chandra
- Tan, Zihan
- Chen, Rong
- Nevill-Manning, Craig
- Garg, Sumegha
- Nicolosi, Antonio R.
- Sinha, Arunesh
- Gong, Ruobin (Robin)
- Chen, Xi
- Nithi, Karun
- Chaudhary, Sunita
- Chen, Yingying
- Nuzman, Carl
- Cherlin, Gregory
- Odlyzko, Andrew
- Chung, Fan
- Chvatal, Vasek
- Olson, Wilma
- Clarkson, Ken
- Onak, Krzysztof
- Coffman, Edward
- Ostrovsky, Rafail
- Compagnoni, Adriana
- Papakonstantinou, Periklis
- Cook, William
- Pardalos, Panos
- Cormode, Graham
- Parida, Laxmi
- Pataki, Gabor
- Dana, Kristin
- Dash, Sanjeeb
- De Bellis, Valerie
- DeMillo, Richard
- Pinkas, Benny
- Di Crescenzo, Giovanni
- Pippenger, Nick
- Pomerance, Carl
- Xia, Lirong
- Abello, James
- Carpenter, Tamra
- Gallos, Lazaros
- Cozzens, Margaret
- Egan, Dennis
- Nelson, Christie
- Post Docs
- Current Post Docs
- Past Post Docs
- Liu, Siqi
- Schoepflin, Daniel
- Ghosh, Prantar
- Tan, Zihan
- Tell, Roei
- Thieme, Cameron
- Wein, Nicole
- McMahon, Troy
- Cohenca, Ariel Schvartzman
- Vieira, Ewerton Rocha
- Moshkovitz, Guy
- Robere, Robert
- Wueller, Stefan
- Ghashami, Mina
- Kong, Jude
- Mohammadi, Jafar
- Stephens-Davidowitz, Noah
- Suarez, Gonzalo
- Monemizadeh, Morteza
- Raz, Orit
- Hatami, Pooya
- Ron-Zewi, Noga
- Das, Bireswar
- De, Anindya
- Nakamura, Brian
- Nelson, Christie
- Ricks, Brian
- Yoda, Kunikazu
- Almaz, Ozhan
- Bhattarcharyya, Arnab
- DeMarco, Robert
- Huang, Hao
- Hui, Cindy
- Meka, Raghu
- Park, Boram
- Roy, Senjuti Basu
- Joyal, Renee Graphia
- Srinivasan, Srikanth
- Newman, Alantha
- Kun, Gabor
- Akavia, Adi
- Cranston, Daniel
- Licona, M Paola Vera
- Yuster, Debbie
- Kayal, Neeraj
- Ramachandran, Vijay
- Bogdanov, Andrej
- Zorych, Ivan
- Ng, Kah Loon
- Weitz, Dror
- Berger-Wolf, Tanya
- Pal, Martin
- Zhong, Sheng
- DeLeenheer, Patrick
- Kindler, Guy
- Chakrabarti, Amit
- Cormode, Graham
- Yong, Xuerong
- Dinur, Irit
- Capalbo, Michael R
- Aduri, Pavan
- Balogh, Jozsef
- Gupta, Anupam
- Magen, Avner
- Nissim, Kobbi
- Melnik, Ofer
- DSouza, Raissa
- Srinivasan, Venkatesh
- Fischer, Eldar
- Nayak, Ashwin
- Schabanel, Nicolas
- Viswanathan, Mahesh
- Ishai, Yuval
- Melkebeek, Dieter van
- Chang, Ee-Chien
- Choe, Myongsu
- Calinescu, Gruia
- Hoseyni-Nasab, Mehdi
- Samorodnitsky, Alex
- Aug, Luca Trevisan
- Varadarajan, Kasturi
- Zane, Francis
- Zosin, Leonid
- Bleichenbacher, Daniel
- Goldwasser, Michael
- Huson, Daniel
- Krivelevich, Michael
- Rajaraman, Rajmohan
- Smith, Mark
- Sweedyk, Elizabeth
- Toth, Geza
- Yooseph, Shibu
- January, Shiyu Zhou
- Beimel, Amos
- Berthiaume, Andre
- Boneh, Dan
- Chen, Hui
- Decatur, Scott
- Hannenhalli, Sridhar
- Kaplan, Haim
- Kelly, Owen
- Mayers, Dominic
- Petrank, Erez
- Puri, Anuj
- Thoma, Lubos
- Valtr, Pavel
- Avigad, Jeremy
- Berry, Jonathan
- Bonet, Maria Luisa
- Etessami, Kousha
- Feldmann, Anja
- Gal, Anna
- Johansson, Anders
- Kahale, Nabil
- Kupferman, Orna Bernholtz
- Rajagopalan, Sivaram
- Ramos, Edgar
- Romanik, Kathleen
- Singh, Mona
- Wilke, Thomas
- Agarwala, Richa
- Bafna, Vineet
- Beals, Robert
- Karolyi, Gyula
- Moyaraz, Eddy
- Muthukrishnan, S
- Narayanan, Babu
- Penrice, Stephen
- Rajagopalan, Sridhar
- Randall, Dana
- Ravi, R
- Ding, Kequan
- Koiran, Pascal
- Liu, Pangfeng
- Liu, Yanzi
- Onn, Shmuel
- Ramana, Moktakuri
- Srinivasan, Aravind
- Teller, Seth
- Tetali, Prasad
- Cohen, Edith
- Kaklamanis, Christos
- Raz, Ran
- Simonyi, Gabor
- Farach, Martin
- Irani, Sandy
- Poutre, Han La
- Pyber, Laszlo
- Sinclair, Alistair
- Sundar, Rajamani
- Szegedy, Mario
- Vertigan, Dirk
- Feder, Tomas
- Feige, Uriel
- Giancarlo, Raffaele
- Kannan, Sampath
- Krawczyk, Hugo
- Lund, Carsten
- Purtill, Mark
- Rubenfeld, Ronitt
- Tardos, Gabor
- Agarwal, Pankaj
- Aronov, Boris
- Hajnal, Peter
- Ierardi, Douglas
- Kenyon-Mathieu, Claire
- Thomas, Robin
- Wenger, Rephael
- Visitors
- Staff
- Programs
- Events
- Event Details
- Seminar Series
- Workshop
- China-US Software Workshop
- DIMACS/CCICADA Workshop on Stochastic Networks: Reliability, Resiliency, and Optimization
- Workshop on Green High Performance Computing (Green HPC)
- DIMACS Workshop on Systems and Networking Advances in Cloud Computing
- China-US Software Workshop 2
- DIMACS Workshop on Connectivity and Resilience for Large-Scale Networks
- Dagstuhl Seminar on Privacy-Oriented Cryptography
- NSF/DIMACS Workshop for Aspiring PIs in Secure and Trustworthy Cyberspace
- DIMACS Workshop on Recent Work on Differential Privacy across Computer Science
- DIMACS Workshop on Information-Theoretic Network Security
- DIMACS Workshop on Geological Data Fusion: Tackling the Statistical Challenges of Interpreting Past Environmental Change
- DIMACS Workshop on Economic Aspects of Information Sharing
- DIMACS Workshop on Energy Infrastructure: Designing for Stability and Resilience
- DIMACS/CCICADA Workshop on Cascading Failures of Power Transmission Systems: Models and Algorithms
- DIMACS Workshop on Current Trends in Cryptology
- DIMACS Workshop on Analysis of Information from Diverse Sources
- DIMACS Working Group on Measuring Anonymity
- DIMACS/BIC/A4Cloud/CSA International Workshop on Trustworthiness, Accountability and Forensics in the Cloud (TAFC)
- DIMACS/CCICADA Workshop on Big Data Integration
- DIMACS Workshop on Algorithmic Information Fusion and Data Mining (WAIFDM)
- DIMACS/CCICADA Workshop on Urban Planning for Climate Events
- DIMACS Workshop on Statistical Analysis of Network Dynamics and Interactions
- DIMACS Working Group on Algorithms for Green Data Storage
- DIMACS Workshop on Algorithms for Green Data Storage
- MPE2013+ Workshop: Challenges and Opportunities - Introducing Participants to MPE2013+ Topics
- DIMACS/RUCIA Workshop on Information Assurance in the Era of Big Data
- DIMACS/CCICADA Workshop on Systems and Analytics of Big Data
- DIMACS Workshop on Secure Cloud Computing
- DIMACS Workshop on Building Communities for Transforming Social Media Research Through New Approaches for Collecting, Analyzing, and Exploring Social Media Data
- MPE 2013+ Workshop on Sustainable Human Environments
- MPE 2013+ Workshop on Global Change
- Reconnect 2014: Forensics
- CEYLA/DIMACS Youth Leadership Training Workshop
- DIMACS Workshop on Multicore and Cryptography
- DIMACS Workshop in Honor of Alan Hoffman
- MPE 2013+ Workshop on Data-aware Energy Use
- DIMACS Conference on Challenges of Identifying Integer Sequences
- Fusion Fest: Marrying Methods to Solve Real-world Problems
- CERI/DIMACS Workshop on Streaming Graph Algorithms (WSGA)
- 11th DIMACS Implementation Challenge: Steiner Tree Problems
- DIMACS Workshop on The Mathematics of Post-Quantum Cryptography
- DIMACS Workshop on Coding-Theoretic Methods for Network Security
- MPE 2013+ Workshop on Natural Disasters
- DIMACS Workshop on Social and Collaborative Information Seeking (SCIS)
- MPE 2013+ Workshop on Management of Natural Resources
- DIMACS and IEEE Working Group on Efficient and Scalable Cyber-security using Algorithms Protected by Electricity (ESCAPE)
- Reconnect 2015: Mathematical and Computational Tools for Social Networks with Applications to Homeland Security
- DIMACS Workshop on Big Data through the Lens of Sublinear Algorithms
- MPE 2013+ Workshop on Education for the Planet Earth of Tomorrow
- DIMACS/Columbia Data Science Institute Workshop on Cryptography for Big Data
- MPE 2013+ International Workshop on Citizen Science
- DIMACS Workshop on Network Coding: the Next 15 Years
- DIMACS Mini-symposium on Modeling of Infectious Diseases with a Focus on Ebola
- DIMACS Workshop on Modeling of Infectious Diseases with a Focus on Ebola
- DIMACS/Statistics Workshop on Fusion Learning, BFF Inferences, and Statistical Foundations: Third BFF (Bayesian, Frequentist & Fiducial) Workshop
- MPE 2013+ Workshop on Connecting Community Colleges to MPE Sustainability Activities
- NSF Algorithms in the Field (AiTF) Workshop on Algorithms for Software-Defined Networking
- DIMACS/MACS Workshop on Cryptography for the RAM Model of Computation
- Reconnect 2016: Mathematical and Computational Tools for Cyber Security
- MPE 2013+ Workshop on PK-12 Education for the Planet Earth of Tomorrow
- DIMACS Workshop on Cryptography and its Interactions: Learning Theory, Coding Theory, and Data Structures
- DIMACS Workshop on Distance Geometry: Theory and Applications
- MPE 2013+ Workshop on Material Transport in Geophysical Flows
- DIMACS/CEF Workshop on Cryptography and Software Obfuscation
- MPE 2013+ Workshop on Zika
- DIMACS Workshop on E+M=C2 Eric Allender and Mike Saks are 60
- MPE 2013+ Workshop on Appropriate Complexity Modeling of the Impacts of Global Change on Ecosystems
- DIMACS/Northeast Big Data Hub Workshop on Privacy and Security for Big Data
- IMS/ASA Spring Research Conference 2017
- DIMACS Workshop on Algorithms for Data Center Networks
- DIMACS Workshop on Complexity of Cryptographic Primitives and Assumptions
- Reconnect 2017: Mathematical and Computational Tools for Energy Efficiency and Reliability of Data Centers and the Electrical GridIndividual Interests vs. the Common Good
- DIMACS Workshop on Outsourcing Computation Securely
- Women in Data Science and Mathematics Research Collaboration Workshop (WiSDM)
- Conference on Algebraic and Extremal Graph Theory
- DIMACS Workshop on Distributed Optimization, Information Processing, and Learning
- MPE 2013+ Workshop on Chesapeake Fisheries: From Oysters to Economics
- DIMACS/Northeast Big Data Hub Workshop on Overcoming Barriers to Data Sharing including Privacy and Fairness
- CCICADA Working Group Meeting: University/USCG Working Meeting on Maritime Cyber Security
- MPE 2013+ Workshop on Modeling Food Systems
- MPE 2013+ Workshop on Developing Sustainability Modules for the Community College Classroom
- Not in My Back Yard (NIMBY): Mathematical and Computational Tools for Decision Making
- DIMACS Workshop on ADMM and Proximal Splitting Methods in Optimization
- MPE 2013+ Workshop: IT'S NOT EASY BEING GREEN: Employing Citizen Science to Map Reptile and Amphibian Distributions
- MPE 2013+ Workshop on Mathematics of Planet Earth - The Future
- MPE 2013+ Workshop on Urban Environmental Sustainability in a Smart and Connected World
- DIMACS/TRIPODS Workshop on Optimization and Machine Learning
- MPE 2013+ Workshop on Global Change and Vector-borne Diseases: Mapping Emerging Infectious Diseases
- Beyond Crypto: A TCS Perspective
- MPE 2013+ Workshop on Automated Biometric Identification of Individual Cheetahs and Leopards
- Rutgers Intelligence Community Center for Academic Excellence (IC CAE) 2018 Colloquium
- The Wright Stuff: Celebrating Rebecca Wright and Her Initiatives at DIMACS
- AEGIS EU-US Roundtable on the Interplay of Technology and Policy in Data Privacy
- New York Area Theory Day - December 7, 2018
- Drones for Safety and Security: A New Agenda
- Opening Workshop for the Professional Development in Computational Thinking Course (Spring 2019, Cottey College)
- Celebratory Mixer - Welcoming NJIT as a DIMACS Partner
- DIMACS/MACS Workshop on Usable, Efficient, and Formally Verified Secure Computation
- Vector-sum Theorems, Their Relatives, and Applications
- 2019 Rutgers Statistics Symposium
- New York Area Theory Day - May 10, 2019
- Reconnect 2019: Cryptography
- DIMACS Workshop on Optimization in Distance Geometry
- CoSP Workshop and School on Algorithms and Complexity
- DIMACS Day of Complexity Tutorials
- Computational Complexity Conference - CCC'19
- 1st Workshop on Advanced Cryptography Standardization (ACS'19)
- Fall 2019 Mixer at Microsoft Research NYC
- DIMACS Workshop on Randomized Numerical Linear Algebra, Statistics, and Optimization
- CRM/DIMACS Workshop on Mixed-Integer Nonlinear Programming
- Three Decades of DIMACS: The Journey Continues
- New York Area Theory Day - December 6, 2019
- DIMACS/LAMSADE Social Responsibility of Algorithms 2019 (SRA19)
- Spring 2020 Mixer at Nokia Bell Labs
- DIMACS Workshop on Information-Theoretic Methods in Complexity Theory
- CCICADA COE COVID-19 Supply Chain Meeting
- Mixed Integer Programming Workshop 2020: Online Edition
- CCICADA/ADAC/CINA Workshop on Enhanced Supply Chain Crime During the Pandemic
- CCICADA/CAOE/CREATE Workshop on Supply of Labor During the Pandemic
- CCICADA/CAOE/CBTS Workshop on Food Supply Chain During the Pandemic
- CCICADA Workshop on Supply Chain for Medicines, Vaccines, PPEs During the Pandemic
- Workshop on Co-Development of Computer Science and Law
- TRIPODS/DATA-INSPIRE Workshop on Making Predictions with Big Data: Fitting, Overfitting and Physics-aided Learning
- COVID-19 VACCINE WORKSHOPS-DHS UNIVERSITY CENTERS OF EXCELLENCE VIRTUAL WORKSHOPS
- CCICADA/CEEZAD Workshop on COVID-19 Vaccines: Efficacy & Safety
- CCICADA/CEEZAD/ADAC Workshop on Vaccine Distribution & Prioritization
- Virtual Mixer for Postdocs & Newcomers
- DIMACS Workshop on Forecasting: From Forecasts to Decisions
- TRIPODS/DATA-INSPIRE Workshop on Monte Carlo, Dynamic Systems and Robotics
- TRIPODS/DATA-INSPIRE Workshop on Dynamics, Topology, and Robotic Control
- Mixed Integer Programming Workshop (MIP2021)
- TRIPODS Data Science Boot Camp Summer 2021
- CCICADA/ADAC/CREATE Workshop on Suez Canal Incident Impact and Implications for the Global Maritime Supply Chain
- AI Day!
- DIMACS Workshop on Arithmetic and Boolean Circuit Complexity
- Workshop on Algorithmic Social Choice
- Rutgers Robotics Workshop 2021
- TRIPODS/DATA-INSPIRE Graduate Student Workshop
- TRIPODS/DATA-INSPIRE Workshop on Democratizing AI - With Jenn Wortman Vaughan, Microsoft Research, and Ariel Procaccia, Harvard University
- 12th DIMACS Implementation Challenge: Vehicle Routing Problems
- DIMACS Workshop on Meta-Complexity, Barriers, and Derandomization
- Workshop on the Analysis of Census Noisy Measurement Files and Differential Privacy
- DIMACS Workshop on Co-Development of Computer Science and Law: Content Moderation
- DIMACS Workshop on Entropy and Optimization
- Mixed Integer Programming Workshop 2022 featuring DANniversary
- DIMACS Workshop on Polynomial Optimization
- Workshop on Algorithms, Combinatorics and Optimization (ACO@CMU): Honoring the 70th Birthday of Gerard Cornuejols
- Reconnect 2022: Optimization
- Social Responsibility of Algorithms 2022 (SRA22)
- Data Science Boot Camp Summer 2022
- REU - Nokia Bell Labs Field Trip
- REU Graduate School Panel
- DIMACS Workshop on Lower Bounds and Frontiers in Data Structures
- IBM/DIMACS/DATA-INSPIRE Workshop on Bridging Game Theory and Machine Learning for Multi-party Decision Making
- Human-Machine Collaboration in a Changing World 2022 (HMC22)
- The 18th Conference on Web and Internet Economics
- TRIPODS/DATA-INSPIRE Workshop Robotics: Science & Systems 2023 Area Chair Workshop @ Rutgers
- TRIPODS/DATA-INSPIRE Workshop on Robotics: Science & Systems 2023 Area Chair Workshop @ Rutgers
- Spring 2023 Mixer at Nokia Bell Labs
- DIMACS/DATA-INSPIRE Workshop on Algorithm and Mechanism Design for Achieving the UN Sustainable Development Goals
- DIMACS Workshop on Computational Approaches to Vehicle Routing with a Tribute to David S. Johnson
- DIMACS Workshop on Modern Techniques in Graph Algorithms
- Reconnect 2023: Risk Assessment
- Data Science Boot Camp Summer 2023
- Young Scholars Program in Discrete Mathematics - Begins
- CCICADA Fall Mixer 2023
- DIMACS Workshop on Foundation Models, Large Language Models, and Game Theory
- DIMACS/LAMSADE Workshop on Meaningful, Useful and Legitimate Information in Decision Making
- DIMACS Workshop on Efficient Algorithms for High Dimensional Metrics: New Tools
- DIMACS Workshop on Modeling Randomness in Neural Network Training: Mathematical, Statistical, and Numerical Guarantees
- Reconnect 2024: AI for Security and Security for AI
- DIMACS Tutorial on Fine-grained Complexity
- Frontiers in Complexity Theory: A Graduate Workshop
- SCRIPS: Supply Chain Resilience Issues, Problems and Solutions for the Homeland Security Enterprise
- Workshop on Simplicity in Mechanism Design and Preference Elicitation
- DIMACS 2024 Workshop on Forecasting
- The 8th International Conference on Algorithmic Decision Theory (ADT 2024)
- DIMACS Tribute to the Many Facets of Fred Roberts
- DIMACS Workshop on Spreading on Social Networks Theory and Applications
- CCICADA Fall Retreat November 1, 2024
- CCICADA Fall Retreat 2024
- Mixer: Discussing Research on an AI-Mediated Society
- Mini-course on Quantum Recursive Programs
- Tutorial on Semantics of Quantum Program
- CCICADA Spring Retreat 2025
- DIMACS Workshop on Quantum Software Systems and Theory
- DIMACS Workshop on Hardness of Approximation in P
- Rutgers Young Scholars Program in Discrete Mathematics - Ends
- CCICADA Fall Retreat 2025
- The 21st Conference on Web and Internet Economics
- Dimacs Workshop on AI-Powered Automation in Ports
- DIMACS/CCICADA Workshop on AI Powered Automation at Ports
- SAMPLE - DIMACS Workshop on Quantum Software Systems and Theory
- CCICADA Spring Retreat 2026
- Reconnect 2026: Port Security
- DIMACS Workshop on Algebraic Techniques in Fine-Grained Complexity
- DIMACS Workshop on Fine-Grained Complexity of String Problems
- DIMACS Workshop on Fine-Grained Complexity of Graph Problems
- 2026 Computational Geometry Week (CG Week)
- 13th DIMACS Implementation Challenge: Network Flows 2.0
- Probabilistic Combinatorics Conference for Jeff Kahn
- DIMACS/CCICADA Workshop on AI and the Maritime Domain
- Seminars
- The wonders of the digital envelope - A crash course in modern cryptography
- On Social Justice, International relations, the Analysis of Literature, and the Study of Social Networks and Communication Networks (Or: On Balanced Signed Graphs and Consistent Market Graphs)
- Two-Factors in Graphs
- Huffman Code Techniques in Testing for Faults in Systems of Components
- Theory of finite sets, linear algebra and a geometric application
- Uniformity and Irregularity
- From Genes to Archaeological Digs and From Traffic Lights to Childhood Development: The Many Applications of Interval Graphs
- Meaningless Statements
- Mathematical and computational aspects of nondestructive testing
- Testing and Checking
- Polynomial Equations Over Matrices
- Water Waves, Solitons, and Unexpected Phenomena
- Euler's 36 officers
- Stalking the Pesky Processor
- Distance in graphs as a basis for social choice procedures
- Why a Computer Needs an Immune System and Why an Immune System Needs a Computer
- Chaotic Epidemic Outbreaks: Are They Deterministic or Random?
- Long Range Effects in Discrete Systems
- Wavelets, Multiresolution Analyses, Filters, and My Summer Research Project
- Randomness and Complexity
- Privacy in Today's World: Solutions and Challenges
- Rank Tolerance Graph Classes
- Generating Functions in Combinatorics and Number Theory
- The Irreducible Representations of SU(2)
- What do statistical regression, maximum cuts and maximum cliques in graphs and pattern classification have in commom? Semidefinite Programming!
- Randomness and Complexity
- Boundary Classes of Graphs for NP-hard Problems: When a Difficult Problem Becomes Easy
- The Erdos-Szekeres Theorem and some related results
- Adventures at Google
- Tic-Tac-Toe Games in Higher Dimensions
- Coding Theory: At the crossroads of algebra, combinatorics, probability, and analysis
- Notes On Combinatorial Games
- Random matrix theory and mathematical physics
- Selberg's integral and its ramifications
- On Hamiltonian Cycles in Graphs
- Pattern Ramsey Numbers and Constrained Decomposition of Graphs
- Group Labels on Hamiltonian Cycles
- How to generate many items?
- The HAVEN (Haptic, Auditory, and Visual Environment)
- Pebbling and Cover Pebbling
- Good Ole Euclidean Plane, Don't We Know All About It?
- How fast can NP-Complete problems be solved in worst case?
- An Introduction to WZ Theory
- Korteweg-deVries, Solitons, and all that
- Knot Theory
- From Spikes to Speed - Accuracy Via the Brainster
- The card game Set
- How Good (or Bad) Can Stable Marriages Be?
- Maximal Independent Sets in Graphs
- Packing densities of permutations
- An Introduction to Integer Partitions
- Language machines
- Combinatorics and Special Functions: the Hermite Polynomials
- Quadratic Forms -- Old and New Results
- When females should stop supporting lazy males: mathematics and honey bees
- Some Fun Theorems in Computational Complexity Theory
- 2 invariants in knot theory
- Origami: Elegant Mathematics and an Amazing Application
- Blank / Length 0
- The channel assignment problem models in graph theory
- Quadratic rabbits
- Secure Computation
- Persistent Social Structures
- Graph-theoretical Models of the Spread and Control of Disease and of Fighting Fires
- Trees and group actions
- Bijective Proofs in Partition Theory
- The Finite Basis Problem
- Arrangements of Lines in the Plane
- Matroids and the Greedy Algorithm
- Clustering - some statistical approaches
- Number of perfect matchings in cubic bridgeless graphs
- Algorithms for Port of Entry Inspection
- The Mathematics of the Rubik's Cube
- Mobius Functions on Partially Ordered Sets
- Incomprehensible Graphs
- Graph Mining
- If You Break It You Should Fix It and If Possible Make It Better: Audio CAPTCHAs
- Meaningless Statements in Epidemiology
- On Constant-Round Concurrent Zero-Knowledge
- Studies on Two Group Testing Problems with the Introduction of Inhibitors
- Modeling HIV Strain Dynamics
- The Astonishing Uniformity of a Typical Billiard Path in the Unit Square
- Beyond Swinging: Hinged Dissections that Twist or Fold
- Counting Restricted Permutations via Computers
- Social Choice and Computer Science
- Matchings in Graphs
- The Search for Earth-like Planets: Yes We Can
- FEMA's Role during a Disaster
- *CrIME:* *Cr*iminal *I*nvestigation through *M*athematical *E*xamination
- Finding cycles in graphs: an introduction to computational homology
- From Olympics to X-Games: Rethinking Innovation for the Digital Century
- Uniformity vs Irregularity
- The Search for Earth-like Planets
- More is Not Better: The Perils of Multiple Solutions at the Boundary between Game Theory and Computer Science
- Introduction to Crossing Numbers
- Minimum Spanning Tree and Connectivity of Large Scale Graphs in MapReduce
- Random Geometric Graphs: A Tutorial I
- Introduction to Symplectic Geometry
- Hamiltonian Dynamics & Symplectic Vector Spaces
- What Makes a Math Problem Beautiful?
- Numerical computations, Experimental Data, and Algebraic Topology
- Random Walks
- Game Theoretic Vulnerability Assessment of Transportation Networks
- Practical Graph Drawing: A Tutorial
- Combinatorial Discrepancy: A Tutorial
- Scalable Graph Analysis
- Numerics, Data and Algebraic Topology
- Representing Integers ONLY using ONE
- Deterministic randomness and unbalanced allocations
- How to Find Who Lives on Your Belly Button: Not Too Short Introduction to Metagenomics
- HCI Meets Data Mining: Principles and Tools for Big Data Analytics
- A Brief Introduction to Sequences and Recurrence Relations
- Geometry and Physics of Minimal Surfaces: a Guided Tour
- Combinatorial Fusion Algorithm: Figure Skating, Internet Search, and Stress Detection
- The Fast Fourier Transform
- Algorithmic Foundations of Robotics
- Ramsey Theory Without Words
- Metaphors and (Mathematical) Models in Science and Poetry
- Conditional Lower Bounds
- Impartial Combinatorial Games
- Math Modeling of Crowd Dynamics
- Connection Games and Sperner's Lemma
- The Art and Artificial Intelligence Laboratory at Rutgers
- The On-Line Encyclopedia of Integer Sequences: Solved and Unsolved Problems
- The earth is not flat
- The Freshman's Dream Identity
- The Triangle Algorithm: A Recipe for Spider-Man to Catch a Villain in any Dimension
- Beyond John Conway's Life
- From single-stream to the wild world of multi-stream algorithms
- Introduction to Deep Learning
- Simple Proofs of Some Determinant Complexity Lower Bounds
- t-Core Partitions
- The Union-Closed Sets Conjecture
- Furstenberg's Multiple Recurrence Theorem
- An Uncertainty Principle and an Application
- Combinatorial Interpretations of Hofstadter-Like Sequences
- Fomin Growth Diagrams or How I Learned to Stop Worrying and Love Young Tableaux
- Counting Maximal Antichains and Independent Sets
- Exploring the Connections between Model Theory and Combinatorics
- Ergodic Ramsey Theory
- Threshold(s) for Perfect Matchings in Graphs
- Oriented Matroids
- How To Avoid a Pattern
- The OEIS: World's Most Useful Web Site for Math?
- Registration and Breakfast
- Auditing Black-box Models
- Kelly Betting and Prediction Markets
- How to compute Pi as Slowly as Possible
- Why Memory Consistency Models Matter in a World of Parallelism and Shared Memory
- Mathematical ecology: A century of progress, and challenges for the next century
- Counting, Entropy, and Compression
- Efficient PAC Learning from the Crowd
- Sporadic Apéry-like Numbers Modulo Primes
- Machine Learning in a Setting of Ordinal Distance Information
- Number of Maximal Independent Sets
- Entropy
- On the Quantitative Hardness of CVP
- CNF-DNF and All That
- Topological Graph Theory
- A Computer Scientist Thinks about the Brain
- Three Lovely Problems from OEIS
- A Reverse Minkowski Theorem
- What do the largest subgraphs of K_n (or the random graph!) with a particular matching number look like?
- Practical Data-Dependent Metric Compression with Provable Guarantees
- Wittgenstein versus Gödel
- Approximate Affine Invariance and Distance to Polynomials
- Fifty Shades of Gray Codes
- A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem
- Growing Graceful Trees
- The Structure of Triangle-free Graphs with no Induced Six-vertex Path
- Towards Optimal Randomness Extractors and Ramsey Graphs
- Problems in Celestial Mechanics
- Monochromatic Components in Random Graphs
- Counting Convex Quadrilaterals
- The MMap Strikes Back: Conquering Cryptography using Weak Multilinear Maps
- Boolean Satisfiability
- Hook formulas for skew shapes: combinatorics, asymptotics and beyond
- Matroids and Greedy Algorithms
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
- Computer Generation of Incidence Theorems in Projective Geometry
- Cutoff for Random to Random
- Partition Bijections
- Syndrome Decoding of Reed-Muller Codes and Tensor Decomposition over Finite Fields
- Remarks on the Classification of the Finite Simple Groups
- Combinatorics and equidistribution of geodesics on flat surfaces
- The Multicolour Ramsey Number of a Long Odd Cycle
- Short Proofs are Hard to Find
- What We Have Here is a Failure to Communicate: A Communication Game and Applications to the Sensitivity Conjecture
- Sleeping Beauty and Other Probability Conundrums
- The Distance Oracle Hierarchy
- An Application of Topology to a Hypergraph Problem
- Hilbert's Monkey Saddle and other Curiosities in the Riesz Equilibrium Problem for 3 Points on a Circle
- Classical and Quantum Walks: Similarities and Differences with Emphasis on Recurrence Properties
- Local MINCUTs and the Ising model on Dense Random Graphs
- Newton's Method: Universality and Geometry
- Combined Cyber and Physical Attacks on the Maritime Transportation System
- On regular 3-wise intersecting families
- Monotonicity Problems in Graph Theory
- Proof Methods in Combinatorics
- Power Series Expansion of the Free Energy for Monomer-dimer Tilings
- Matrix Sketching over Streams
- The Angel Problem
- Symmetry Breaking in SAT and QBF
- Incremental Methods for Additive Convex Cost Optimization
- Using rectangular convolutions to construct biregular expanders
- Explicit Binary Tree Codes with Polylogarithmic Size Alphabet
- Noncommutative Rogers-Ramanujan continued fraction and related results
- Electrical Engineering, Operations Research and Machine Learning for Power Distribution
- Gyarfas-Sumner meets Erdos-HajnalGyarfas-Sumner meets Erdos-Hajnal
- Some Closure Results for Polynomial Factorization
- Counting Random Sheep
- Fast Quantum Algorithm for Solving Multivariate Quadratic Equations
- Cayley Graphs and List-decodable Zero-rate Codes
- Complete Derandomization of Identity Testing of Read-Once Formulas
- Model Theory and Combinatorics
- Bijective Proofs of some new MacMahon-style Partition Identities
- Universality of Random Functions
- Parking Function
- Various Constructions and Applications of Hadamard and Weighing Matrices
- Hypergraphs and higher dimension analogs of VC dimension
- The Univalent Foundations through UniMath and some combinatorial problems
- Asymptotics in bond percolation on expanders
- Hitting Sets with Near-Optimal Error for Read-Once Branching Programs
- r-Complete Sequences of Positive Integers
- An Experimental Mathematics Approach to some Combinatorial Problems (Thesis Defense)
- Unimodal Polynomials and Lattice Walk Enumeration with Experimental Mathematics (Thesis Defense)
- On the Hardness of Coloring Rainbow-colorable Hypergraphs
- Jacobian Groups of Graphs
- General Strong Polarization
- Several Topics in Experimental Mathematics (Thesis Defense)
- Games of Hide-and-seek with Balls in Boxes
- K-means Clustering with Optimization
- Automating Summations
- Computer-assisted Explorations and Proofs in the Moving Sofa Problem
- Tower-type Bounds for Roth's Theorem with Popular Differences
- Taking Control by Convex Optimization
- Symmetric Designs
- Experimental "Solutions" to Select Stopping Problems
- On the expressiveness of comparison queries
- Between Shannon and Hamming: the impact of delay on communication capacity
- Coloring Hypercubes
- A Journey into Clusters-the Goulden-Jackson method and All That
- The Smallest Eigenvalues of some Hamming and Johnson Graphs
- Set Cover in Sub-linear Time
- Mathematical Modeling of Cardiovascular Dynamics during Orthostatic Stress
- Trans-disciplinary adventures in the mathematical biology of networks: from disease outbreaks to cyber attacks
- Ligero: Lightweight Sublinear Zero-Knowledge Arguments
- A taste of celestial mechanics
- Wagering Games
- Symbolic Evaluation of Determinants and Rhombus Tilings of Holey Hexagons
- How to Generate all Possible WZ-pairs Algorithmically?
- How Likely to Succeed is a Bitcoin Attack, and How Long Should it Take?
- Trees and Linear Anticomplete Sets
- An Algebraic Proof of Sperner's Theorem
- A Proof-Theoretic Analysis of the Rotation Lattice of Binary Trees
- On a Problem of Littlewood : Counting Zeros of Cosine Polynomials
- Interactive Proofs
- Experimental Mathematical Evidence for a Conjecture About Relative Entropy with Complex Measures
- Decomposing the Complete R-Graph
- An Important Graph
- Parking Function, Bijection and Area Statistic
- The Number of 4-Colorings of the Hamming Cube
- Telescoping Method and Congruences for Double Summations
- Generalized Turan-Type Problems for Random Graphs.
- On Communication Complexity of Classification Problems
- Tuza's Conjecture
- Minimal Length Representations of the Natural Numbers and Why They Matter
- Locally Decodable Codes and Arithmetic Progressions in Random Settings
- An Introduction to WZ Theory
- Applying Representation Theory to Random Walks
- Limiting Eigenvalue Distribution for the Non-Backtracking Matrix of an Erdos-Renyi Random Graph
- Probing Algorithms for Combinatorial Optimization Under Uncertainty
- It's Hard to Find a Stable Marriage: Strategic Exploitation of the Gale-Shapley Algorithm
- Using Number Theory and Combinatorial Optimization to Solve a Problem in Statistics
- Bootstrap Percolation on Uniform Attachment Graphs
- Faculty Research Talks (in conjunction with Graduate Algebra and Representation Theory Seminar (GARTS))
- Schemes for Words
- The Upper Tail for Triangles in Sparse Random Graphs
- The Important Graphs are Indeed Important
- Efficient Algorithms for Tensor Scaline, Quantum Marginals, and Moment Polytopes
- Factoring Random Polynomials
- Local Limit Theorems on Random Graphs
- Keith Hopefully Finally Talks About Containers
- Online Bipartite Matching with Amortized O(log^2 N) Replacements
- Machine Learning and Ballistics: a Data Analytics Project in Partnership with the New Jersey State Police
- The Chromatic Index of Random Multigraphs
- Powers of Hamiltonian Cycles in Randomly Augmented Graphs
- Some Interesting Combinatorics and Probability Problems in Job Interviews
- Construction of the Low-Degree Boolean Polynomials
- Optimization of Random Functions Over the Hypercube
- Welcome and Overview
- An Application of Non-Boolean Fourier Analysis
- Quasiregular Matroids
- Approximating the Edit Distance to Within a Constant Factor in Truly Subquadratic Time
- Lifting with Simple Gadgets and Applications for Cutting Planes
- CoEulerian Graphs
- Torus Polynomials: an Algebraic Approach to ACC Lower Bounds
- Coordination Sequences, Planing Numbers, and Other Recent Sequences (II)
- A Tight Bound for Hypergraph Regularity
- Fair PCA
- Distribution of Geodesic on Cube and Other Surfaces
- Some Tools for Proving Asymptotic Normality and an Application to Cores
- The Probability that a Matrix with Rademacher Entries is Normal
- Wagering Mechanisms for Probability Elicitation and Surprising other Applications
- Unique Sum-free Sets
- Game-Theoretic Foundations for Probability and Statistics
- A Reverse Sidorenko Inequality
- Bloom Filters, Adaptivity and the Dictionary Problem
- The Orchard Problem
- Structure in Stack-Sorting
- Geometry of Networks: Past Twenty Years and New Challenges
- Are Factors of Sparse Polynomials Sparse?
- Planarity, Exclusivity, and Unambiguity
- Relaxed Partitions
- Patterns in Random Permutations
- Allocating Scarce Societal Resources Based on Predictions of Outcomes
- The Alon-Jaeger-Tarsi Conjecture
- Trees, Fibonacci Numbers, and Nested Recurrences
- Detecting an Odd Hole
- Hitting the Forest with the Trees
- Near Log-Convexity of Heat and the K-Hamming Distance Problem
- What is Pi, and What it is Not
- An Isoperimetric Inequality for the Hamming Cube and Some Consequences
- Beyond Trace Reconstruction: Population Recovery from the Deletion Channel
- Automated Conjecturing in Mathematics - with the CONJECTURING Program
- Hitting Times for Shamir's Problem
- Analyzing Optimization in Deep Learning via Trajectories
- The Combinatorics of Orthogonal Polynomials
- When 1/pi^2 and Calabi-Yau Meet
- Convex Cones, Integral Zonotopes, and their Limit Shape
- Polynomial Pass Lower Bounds for Graph Streaming Algorithms
- Combinatorial Nullstellensatz and List Coloring
- Game Theory-An Alternative Mathematical Experience
- Series Multisection and the Cyclic Sieving Phenomenon
- Strong Direct Sum for Randomized Query Complexity
- Some Experimental Observations and Open Questions About the Alpha-Permanent
- The Littlewood-Offord Problem in Groups
- A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem
- An Introduction to the Foundations of Quantum Theory
- The Asymptotic Spectrum of Graphs: Duality for Shannon Capacity
- Towards Modeling a Dynamic Privacy-Preserving Bartering System
- Independent Sets in the Hypercube
- A Sharper Bound for the Joints Problem
- Codes for Secure Distributed Matrix Multiplication
- New Unsolved Problems from the On-Line Encyclopedia of Integer Sequences
- Induced subgraphs and coloring
- The Hadamard maximum determinant problem
- Three Permutations, Simplified
- Deep Analytics: From NLP, Computer Vision to Sensors
- Network algorithms in an increasingly connected world
- Model Theory and Combinatorics
- The Number of Maximal Independent Sets in the Hamming Cube
- Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
- The Peaceable Queens Problem
- On the threshold for simple connectivity in random 2-complexes
- On Multilinear Forms: Bias, Correlation, and Tensor Rank
- A Spectral Proof of Katona's T-Intersection Theorem
- Contour Approximation of Data, with Applications
- Exact Quantitative Versions of Helly's Theorem
- A Quick Introduction to Entropy
- Flexible Schemes for Pattern-Avoiding Permutations
- On Some Properties of Graph Norms
- How to Store a Random Walk
- Implicit Regularization for Optimal Sparse Recovery
- Combinatorial Group Theory
- Ethics and the Future of AI (Panel & Reception)
- Patterns and Partitions
- Extremal Configurations in Point-Line Arrangements
- Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility
- Correlation Inequalities for Permutations
- Old and New Problems from 55 Years of the OEIS
- Hypercontractivity, Sharp Thresholds and Extremal Combinatorics
- Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
- A Maximum Determinant Problem
- The Ergonomics of Computer Algebra
- Improved Bounds for Sunflowers
- The Asymptotic Spectrum of Tensors and Barriers for Fast Matrix Multiplication
- Burgess' Bound on Character Sums
- On the Parity of Restricted Partition Functions
- Graph Powering and Spectral Robustness
- An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
- The Classical Radiation Reaction Problem
- Non-Concentration of the Chromatic Number of G(n, 1/2)
- Faculty Research Talks
- Recent Advances in Stochastic Gradient Methods: From Convex to Non-convex Optimization and Deep Learning
- Diamond Operations on Lattices and Factorizations of Noncommutative Polynomials
- Super-Logarithmic Cliques in Dense Inhomogeneous Random Graphs
- Optimal Data Acquisition for Statistical Estimation
- Helly's Theorem and Generalizations
- Systematic Counting of Pattern-Avoiding Partitions and Some New Partition Identities
- Canonical Ramsey Numbers for Edge-Ordered Hypergraphs
- Online Vector Balancing and Geometric Discrepancy
- Arrow's Impossibility Theorem
- Concentration Inequalities for Finding Rainbow Matchings
- The Karger-Stein Algorithm is Optimal for k-cut
- Dynamic Programming and Combinatorial Game Theory
- Searching for Modular Companions
- Double-Samplers and Local-to-Global List Decoding
- Where is the Spiral?
- Hardness of Generators for Invariant Rings
- Finite Field Furstenberg Sets
- 0, 1, 8, 78, 944, 13800, 237432, 4708144, 105822432, 2660215680, 73983185000, 2255828154624, ...: "The sequence that started it all"
- New Results on Projections
- Scattering and Sparse Partitions, and their Applications
- Parallel Repetition of Games
- A Globally Convergent Newton Method for Polynomials
- Cooperation in Humans and Machines
- Ramsey Upper Density of Infinite Graphs
- Structure and Dynamics of Contagion in Financial Networks
- On Symmetric 3-Wise Intersecting Families
- Using Central Limit Theorems: Balls in Bins and More
- Thresholds Versus Fractional-Expectation Thresholds
- Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
- Squags, Sloops, Quasigroups and Loops: Using made-up words to find Latin Squares
- Collatz Polynomials: an Introduction with Bounds on their Zeros
- How Prolific is a Random Permutation?
- An Adaptive Step Toward the Multiphase Conjecture
- How Many Ways Can a Permutation in S_n be Written as a Product of k Transpositions?
- A New World Record for the Irrationality Measure of Pi
- Pure Pairs in Graphs with Forbidden Induced Subgraphs
- Stochastic Local Search and the Lovasz Local Lemma
- Electric Networks and Square Tilings
- Packing in Restricted Permutations
- Independent Set Permutations, and Matching Permutations
- Automorphisms of Induced Subgraphs of Gn,p.
- Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
- The Hermite-Serret Algorithm
- Toric Geometry and Ehrhart Theory of the CFN Model with a Molecular Clock
- Combinatorics of Quadratic Spaces over Finite Fields
- A Criterion for Asymptotic Sharpness in the Enumeration of Simply Generated Trees
- Tips and Tricks for Writing Efficiently in the Mathematical Sciences
- Slow Fibonacci Walks
- Mixed Frequency Data Inputs for Recurrent Neural Networks
- Generalized Snake Graphs from Orbifolds
- From Generalized Factorials to Greedoids, or the Unavoidability of the Vandermonde Determinant
- Chip-firing on Cell Complexes and Matroids
- From Optimization Algorithms to Dynamical Systems and Back
- A Positivity Phenomenon in Elsers Gaussian-cluster Percolation Model
- AI Tools for Creative Work
- Many Disjoint Triangles in Co-Triangle-Free Graphs
- From Lambda Calculus to the Four Color Theorem, via Experimental Mathematics
- Understanding machine learning with statistical physics
- Privacy in Today's World
- Algorithmic fairness
- Interpretability vs. Explainability in Machine Learning
- Interpretability vs. Explainability in Machine Learning
- Cooperative Puzzles
- Enhanced Supply Chain Crime During the Pandemic
- Supply of Labor During the Pandemic
- Supply Chain for Medicines, Vaccines, PPEs During the Pandemic
- Food Supply Chain During the Pandemic
- Optimal and Approximately Optimal Mechanism Design Beyond a Single Dimension
- Conant's Gasket, Recaman Variations, the Enots Wolley Sequence, and Stained Glass Windows
- Learning Interaction Laws in Particle- and Agent-based Systems
- Permutation Puzzles: Rubik's cube and 15-puzzle
- Range Query on Planar Graphs and Applications on Spatial Sensing with Privacy
- Making Many More Matrix Multiplication Methods
- Dependent Random Choice
- Improved Bounds for Distributed Load Balancing
- Automagic Inverse Continued Fraction Calculators
- The Erdős-Szekeres Conjecture
- The Worker-Task Assignment Problem
- Network Coding Gaps for Completion Times of Multiple Unicasts
- Multiscale Substitution Tilings
- The Small Core of Matching Markets: Two Explanations
- Graph Connectivity and Single Element Recovery via Linear and OR Measurements: Rounds v Query Trade-offs
- Too Acute to be True?
- Hypernetwork Science, Theory and Practice
- Discussion of: Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures
- Recent Applications of Expanders to Graph Algorithms
- On Christol's Conjecture
- Mechanism Design and Data Science
- Discussion of Two Papers on Preference Misrepresentation in Matching
- Using Satellite Imagery and Deep Learning to Target Aid in Data-sparse Contexts
- Planar Distance Oracles
- Partition Identities, Q-series Identities, and Experimental Mathematics
- On Partial Differential Encodings of Boolean Functions
- Faster K-clique Counting in Bounded Arboricity Graphs
- Noncommutative Catalan Numbers, Orthogonal Polynomials and Beyond
- Discussion of: Two-sided Matching Markets with Correlated Random Preferences Have Few Stable Pairs
- On Communicating Over Networks Without Revealing Their Topology
- Triangle-Intersecting Families of Graphs
- Rethinking the Foundations of Mathematics and its Practical Consequences
- Auditing and Controlling Algorithmic Bias
- Strategyproofness You Can Explain to Your Grandmother
- Classical Mechanics, Symplectic Geometry, Combinatorics
- Balls and Bins and Icebergs
- From Stern's Triangle to Upper Homogeneous Posets
- Risky Decisions: How Mathematical Paradoxes and Other Conundrums Have Shaped Economic Science
- Long Duration Autonomy With Applications to Persistent Environmental Monitoring
- Discussion of: The Complexity of Interactively Learning a Stable Matching by Trial and Error
- Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graphs
- Gomory-Hu Trees
- Algorithmically Distinguishing Irreducible Characters of the Symmetric Group
- Discussion of: The Influence of One Strategic Agent on the Core of Stable Matchings
- Artificial Intelligence for Wildlife Conservation: AI and Humans Combating Extinction Together
- COVID-19 Vaccines: Efficacy & Safety
- COVID-19 Vaccines: Distribution & Prioritization
- Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths
- Counting Matrices that are Squares
- Discussion of: Correlation Neglect in Student-to-School Matching
- Cyclic Permutations, Shuffles, and Quasi-Symmetric Functions
- Cumulants and Stack-Sorting
- Discussion of: Need vs. Merit: The Large Core of College Admissions Markets
- Stopped Sequences and the Narayana-Zidek-Capell Numbers
- Game Complexity: Between Geography and Santorini
- Throwing a Sofa Through the Window
- Data Mining and Ramsey Theory
- Integrated Inference Analyses to Dissect Tumor Mutational Profiles
- Discussion of: A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings
- Random Talks
- Approximating Edit Distance in Near-Linear Time
- Padovan, Pascal, and Proofs Without Words
- Ethics Washing in AI
- The Chvátal-Rödl-Szemerédi-Trotter Theorem
- Learning Low-Rank Tensors and Depth-3 Multilinear Circuits
- A Maple-assisted study of a Schroedinger-Newton, a.k.a. Schroedinger-Poisson, a.k.a. Choquard, a.k.a. Pekar, a.k.a. ... equation
- Learning Sign Language with AI Driven Grammar Checking
- Open Group Disucssion
- Approximation Algorithms for Max-CSPs in the Streaming Model
- Refinements and Symmetries for Volumes of Flow Polytopes
- Combinatorial Description of Global Dynamics (an approach to solve ODE)
- Discussion of: First-Choice Maximal and First-Choice Stable School Choice Mechanisms
- Breaking the 2^n barrier for 5-coloring and 6-coloring
- Proofs of the Riemann Hypothesis, the P ≠NP conjecture, the Goldbach Cojecture, and the Irrationality of γ
- Change-point Detection for COVID-19 Time Series via Self-normalization
- New Conditional Lower Bounds for Approximating Diameter in Directed Graphs
- Motivated Proof of the Rogers-Ramanujan Identities
- Pairing Strategies for Tic-Tac-Toe on the Boolean Hypercube
- Dynamic Longest Increasing Subsequence and the Erdos-Szekeres Partitioning Problem
- What is a Combinatorial Interpretation
- Distance Oracles for Planar Graphs
- On Stanley-Wilf limit of the pattern 1324
- Maintaining and Rounding Dynamic Fractional Matchings
- Locality Preserving Hash Functions, a Partial Order and Tiles in Binary Space
- An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model
- Data Analysis in High-dimensional Spaces
- Co-evolution of Opinion and Social Tie Dynamics Towards Structural Balance
- A Guided Tour of the On-Line Encyclopedia of Integer Sequences
- Robotic Rearrangement - Two Talks by DIMACS TRIPODS Students
- Topology and Geometry of Urban Road Networks
- Pushing the boundaries of educational technology
- Necklace splitting on trees
- Weak saturation on graphs and hypergraphs
- The Seeing-eye Robot Grand Challenge: Developing a Human-Aware Artificial Collaborator
- Auditing and countering algorithmic bias
- Making AI useful and usable
- Lovely New Problems From the Past Months
- Upper Tails of Subgraph Counts in Sparse Regular Graphs
- Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity
- Difference Ring Algorithms for Symbolic Summation and Challenging Applications
- Bounds for subsets of $mathbb{F}_p^n times mathbb{F}_p^n$ without L-shaped configurations
- Reversing Color Coding
- Coloring Subsets with r-wise Intersecting Color Classes
- Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
- An Experimental (yet fully rigorous!) Study of a certain "Measure Of Disarray" that 12-year Noga Alon Proved was always Even
- Attractors of Nonsmooth and Multivalued Dynamical Systems
- A Topological Turán Problem
- The Real Reasons Linear Algebra is Useful or: A Love Letter to Traditionalists
- Hardness for Structured Linear Equations and Linear Programs
- A Dynamic Approach for the Zeros of the Riemann Zeta Function - Collision and Repulsion
- Palette Sparsification for Vertex Coloring
- Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
- Moments of Permutation Statistics and Central Limit Theorems
- Locality in Computation
- Long Common Subsequences between Bitstrings
- Lower Bounds for Shortcut Sets and Additive Spanners
- Combinatorics behind the Degenerate Eulerian Numbers
- Localization and Concentration of Measures on the Discrete Hypercube with Applications to Interacting Particle Systems
- Deterministic Budget-Feasible Clock Auctions
- Finite Axioms of Choice
- Accelerating Hypergeometric Indefinite Summation
- Helly-type Problems: Topology, the Cascade Conjecture, and Graph Coloring
- Making Graph Sketching Practical
- Lucas Congruences Modulo p2
- Linear Cover Time is Exponentially Unlikely
- Eliciting Expert Information
- Diameter of Polyhedral Graphs
- Reflecting (on) the Modulo 9 Kanade--Russell (conjectural) Identities
- SAT-Hub: Smart and Accessible Transportation Hub for Assistive Navigation and Facility Management
- Simplicity and Optimality in Multi-Item Auctions
- An Overview of the Parallel Repetition Theorem
- Counting Baxter Matrices
- Motion Planning Advancements and Applications in Computational Biology: An Algebraic Topology Perspective
- Tight Ramsey Bounds for Multiple Copies of a Graph
- Better Approximation of Graph Crossing Number
- Combinatorial Atlas for Log-concave Inequalities
- Tight Space Complexity of the Coin Problem
- Sycamore and Other Quantum Supremacy Experiments
- On the Topic of Ramsey Multiplicities
- New Diameter Reducing Shortcuts: Breaking the $O(sqrt{n})$ Barrier
- Counting Angles in Discrete Point Sets
- Experimental Complexity Theory?
- Converse and Achievable Bounds for Finite Length Quantum Codes in Quantum Erasure Channel
- The Zero Rate Threshold For Adversarial Bit-Deletions is Less Than 1/2
- Tchoukaillon Numbers
- Open Problems in NOF Communication Complexity
- Packing and Covering Triangles in Graphs
- Determinant Solutions for Nonlinear Differential Equations in the Commutative and Noncommutative Case
- Almost Optimal Inapproximability of Multidimensional Packing Problems
- List Lengths and Color Degrees
- Pattern Avoidance in Parking Functions
- Algorithms Using Local Graph Features to Predict Epidemics
- Cancellative Families
- Some Trigonometric Identities Associated with the Roots of Unity
- Multicolored Hypergraph Ramsey Numbers
- Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark
- The Chromatic Symmetric Function of Trees
- The Method of Brackets. How to Integrate in an Easy Manner
- Sharp Density Bounds on the Finite Field Kakeya Problem
- Fast Multivariate Multipoint Evaluation Over Finite Fields of Small Characteristic (and Applications)
- Statistical Inference for High-dimensional Block-wise Missing Data
- Combinatorics So Easy My Undergrads Can Do It
- Sorting Probabilities for Young Diagrams
- Triangular-Grid Billiards and Plabic Graphs
- Strongly Sublinear Algorithms for Testing Pattern Freeness
- A Talk on the Diameters of Commuting Graphs of Matrix Rings
- Combinatorial Exploration: An Algorithmic Framework for Enumeration
- Ramsey's Theorem in the Countable and the Approximate Erdős-Hajnal Property
- Statistical Methods for Harmonizing Multi-scanner Neuroimaging
- Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
- Oh My God They Were Roommates: Achieving Envy-Free Rent Division
- Origami Flip Graphs of Flat-Foldable Vertices
- Logical and Natural Properties of Random Graphs
- Repro Sampling Method for Statistical Inference of High Dimensional Linear Models
- Privately Estimating Graph Parameters in Sublinear Time
- How Many Ways Can You Solve a Ring-Ring Puzzle Starting From an Empty Grid?
- Sharing Pizza in n Dimensions
- Stationary Optimal Transport with Applications to Graph Alignment
- Highly-efficient Interactive Oracle Proofs & Cryptographic Applications
- Minimal Circuits for Boolean Functions
- Deterministic (1+ε)-Approximate Maximum Matching with ð—‰ð—ˆð—…ð—’(1/ε) Passes in the Semi-Streaming Model and Beyond
- The Meta C-Finite Ansatz
- Predictability, Stability, and Causality with a Case Study to Find Genetic Drivers of a Heart Disease
- Threshold for Stacked Triangulations
- Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs
- Exact Specral Gap and Gap Eigenfunctions for a Class of Graphs Generalizing the Johnson Graphs
- Instance Dependent Sample Complexity Bounds for Interactive Learning
- Online List Labeling: Breaking the log^2 n Barrier
- Intersections of Statistical Mechanics and Combinatorics
- Voting on Cyclic Orders, Representations, and Ties
- Explaining the Decisions of AI Systems
- Distributed Degree+1-Coloring and Applications
- Game Theory: Foundation and Applications
- Regular languages and cobordisms of decorated manifolds
- A Systematization of Content Moderation in End-to-End Encryption
- Visual Exploration of Billion Edge Graphs
- Connecting the Dots: Using Combinatorial Optimization to Design Visual Artwork
- Arc-Intersection Queries Amid Triangles in Three Dimensions and Related Problems
- Negative-Weight Single-Source Shortest Paths in Near-linear Time
- Kempe's Attempted Proof of the Four Color Theorem
- Order-of-addition Experiments: Design and Analysis
- New Sequence Problems and Solutions from 2022
- The Number of n-queens Configurations
- A New Characterization of Statistical Zero Knowledge
- The Hedgehog
- A Robust, Differentially Private Randomized Experiment for Evaluating Online Educational Programs with Sensitive Student Data
- The Random Turán Problem for Bipartite Graphs
- Near-Linear eps-Emulators for Planar Graphs
- Co__n_ T_eo_y
- Estimating Means of Bounded Random Variables by Betting
- Parameter Estimation in Discrete-time Systems
- Quantitative Problems in Infinite Graph Ramsey Theory
- Hybrid Robotics and Implicit Learning
- A Modelling Framework for Regression with Collinearity
- Advanced Encryption Systems for RAMs
- Extreme Trees
- Searching for Truth through Data
- The Least Euclidean Distortion Constant of a Distance-regular Graph
- Adversarially Robust Coloring for Graph Streams
- Comparing the Cardinalities of Two Dilates
- Copula-based Approaches by Analyzing non-Gaussian Spatial Data
- Sorting Probability for Young Diagrams
- A Structural Szemerédi-Trotter Theorem for Cartesian Products
- Cut Query Algorithms Using Star Contraction
- Using the Borsuk-Ulam Theorem to Prove the Chromatic Number of the Knaser Graph
- Counter Examples for Stochastic Gradient Descent
- Learning-Based Robot Control from Vision: Formal Guarantees and Fundamental Limits
- Log-concavity and Cross Product Conjecture in Order Theory
- Random Restrictions on Boolean Functions with Small Influences
- Spectral Telescope: Convergence Rate Bounds for Random- Scan Gibbs Samplers Based on a Hierarchical Structure
- Skeletons and Shadows (of polytopes)
- Enumerative Combinatorics and Coding Theory
- Product Free Sets in the Alternating Group
- Reproducibility in Learning
- Planar Turà n Number: Plane Graph Decomposition and Contribution Method
- Sufficient Reductions in Regression with Mixed Predictors
- Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
- Some Random Algebra and Rational Exponents
- Robust Mendelian Randomization in the Presence of Many Weak Instruments and Widespread Horizontal Pleiotropy
- The Arithmetic-Periodicity of the game CUT
- Logarithmically Larger Deletion Codes
- Change-point Detection: Computation and Statistical Inference
- Realisations of Posets and Tameness
- Post-hoc Explanations: Unifications, Robustness and Disagreements
- Extremal Pattern-Avoiding Words
- Hitting a Prime in 2.43 Dice Rolls (on average) and on Round-Robin Tournaments with a Unique Maximum Score
- Convex Polytopes from Fewer Points
- Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
- Polynomial Bounds on Parallel Repetition For All 3-Player Games with Binary Inputs
- Data Augmentation MCMC for Bayesian Inference from Privatized Data
- Chess, Dominos, and Counting
- Unification of Set Partitions
- Universal Sorting: Finding a DAG with Priced Comparisons
- The Sinkless Orientation Meditation
- Constant-Depth Sorting Networks
- Continued Fractions and the 4-Color Theorem
- Distance-Estimation Algorithms and Hardness for Modern Graphs
- Linear Space Data Structures for Finite Groups with Constant Query-Time
- Formalization of Euclids Elements
- Site Percolation on Planar Graphs and Circle Packings
- Testing Convex Truncation
- Olean Files and Formalizing Euclid's Fifth Book
- Thresholds
- The Turán Number of the Grid
- Optimal Oblivious Reconfigurable Networks
- Taking the Joke too Far: Extremal Results in Joke Papers
- Formal Proofs of the Pythagorean Theorem: Style and Choices
- AI for Mathematics
- Unit and Distinct Distances in Typical Norms
- Estimating Paramethers of a Network by Crawling
- Compactness in Combinatorics
- The Type System of Lean
- Gosper's Algorithm and Bell Numbers
- Random k-out Subgraphs
- Smoothed Analysis of the Simplex Method
- Towards Formalizing the Pythagorean Theorem
- The Mathematics of Elections
- On the Evolution of Triangle-Free Graphs in the Ordered Regime
- Graph Sparsification and Kadison-Singer Problem
- An Overview of "HyperTree Proof Search for Neural Theorem Proving"
- On the 3-Colorability of Fork-Free and Triangle-Free Graphs
- Noncommutative Generalized Catalan Numbers and their Generating Functions
- Neuro-symbolic Learning for Bilevel Planning
- Enumerating Interval Graphs and D-Representable Complexes
- Formalizing a Second Proof of the Pythagorean Theorem
- Simple, Deterministic, and Fast (but Weak) Approximation for Edit Distance and Dyck Edit Distance
- Reconstructing Random Pictures
- Differential Privacy and the Overall Privacy of 2020 Census Data
- Recent Progress on Fault Tolerant Spanners and Emulators
- Lean Coding Conventions
- FLOWER POWER: Using a Variant of the Delta System Method
- Solving the Race in Backgammon
- Antichain Codes
- On Weighted Graph Sparsification by Linear Sketching
- Lean 3 versus Lean 4
- Partitioning a Square into Similar Rectangles
- Expected Hitting Times on Finite Graphs
- Random Order Streaming Lower Bounds for Connected Components
- Euclidean Geometry in Lean 4
- Subgraph Complementation and Minimum Rank
- ð›¿-Boundedness
- Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS
- A Functional Approach to Graph Labeling
- Entropy and Letter Density for Shifts of Finite Type
- Recent Advances in Multi-Pass Graph Streaming Lower Bounds
- How Auxiliary Information Can Help Your Missing Data Problem
- A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-connected Graphs
- Convex Polygons in Lean 4
- Influences for Convex Sets
- Quasi-Linear Relation Between Structure and Randomness
- Proofs of the Pythagorean Theorem in Lean 4
- Minimal Hall Violators and Matroids
- Ramanujan Series for Automatic Proofs
- A Constant Lower Bound for Frankl's Union-Closed Sets Conjecture
- Mechanism Design with Predictions
- Reconstructing 3D Cube Complexes from Boundary Distances
- Teaching Lean vs. Teaching with Lean
- A "Calculation-heavy" Introduction to Proof, with Support from Lean
- Metaprogramming for Mathematics
- Smooth Vector Bundles in Lean
- Scalable and Explainable AI Analytics for Computer Vision and Medical Applications
- Basics of Ramsey theory: the work of Erdos and Szekeres
- Proofs by Example
- What does an [X Kind of Mathematician] do?
- Probability and Intuition
- 2-Dimensional Spectral Expansion of Random Geometric Graphs
- New Gilbreath Conjectures, Sum and Erase, Dissecting Polygons, and Other New Sequences
- A Random Graph Model for Clustering Graphs
- Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond $1+alpha$-th Moments
- h -vector Inequalities under Weak Maps
- The Structure of Lonely Runner Spectra
- Thin Trees for Laminar Families
- FKG, AD and more!
- The Ramanujan Machine 2.0: Algorithm-assisted Discovery of an Intrinsic Order Among Mathematical Constants
- Inequalities for totally nonnegative matrices: Gantmacher--Krein, Karlin, and Laplace
- User-Level Differential Privacy With Few Examples Per User
- Turan Numbers and the Szabo Calculus
- A New Upper Bound for the Heilbronn Triangle Problem
- How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity
- Introduction to The Brun Sieve
- Gambler's Ruin with K Gamblers
- Optimal Online Discrepancy Minimization
- Sperner's Lemma on Simplices, and some applications
- Tight Bound and Structural Theorem for Joints
- Exploring the Shape of Data with Persistence Module and Topological Stable Representation
- Percolation
- Hardinian Arrays
- Asymptotics for Palette Sparsification
- Blockchain Transaction Fee Mechanisms - an Axiomatic and Non-Myopic Analysis
- Symmetric Functionology
- Erdos-Ginzburg-Ziv Problem in Large Dimension
- Online Omniprediction
- Counting Random Graphs
- Characterizing Transcendence in Combinatorics
- Euclid, Employment and Education
- The Frog Model on Trees
- Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
- Configuration Perspective for Turan Problems
- Linear Algebra Game
- Recent Applications Concerning WZ Theory
- On the H-space of a Random Graph
- On the Zeroes of Hypergraph Independence Polynomials
- Some Recent Advances in Differentially Private Continual Counting
- ProofWidgets4 - Diagram and Reference in Lean
- Poset Dimensions
- Sphere Packings, Singularities, and Statistical Mechanics
- Recent Advances in Streaming Multi-armed Bandits
- Sidorenko Hypergraphs and Random Turan Numbers
- Agreement Testing and Small Set Mixing in High Dimensional Expanders
- Nontrivial zeros of the Riemann zeta function know a lot
- Optimal Bounds on Private Graph Approximation
- Chasing Positive Bodies
- 1/3-2/3 Conjecture
- Minimal Cuts in the Z^D Lattice with Random Capacities
- Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching
- Hook-Length Formula
- Counting Maximal Seat Assignments that Obey Social Distancing
- Sets that Support a Joint Distribution
- Sub-quadratic (1+\eps)-approximate Euclidean Spanners, with Applications
- A Dentist Glove Problem
- Envy-Free Distributions in High Dimensions
- Log-Concave Sampling
- Tree Decompositions and Spanning Trees
- Allen Tannenbaum and Computer Vision
- Sparsifying Generalized Linear Models
- An Exponential Lower Bound on Three Query, Linear Locally Correctable Codes
- Unfriendly Partitions of Graphs
- Predictive and Prescriptive Analytics for Offshore Wind Energy: Uncertainty, Operations, and Reliability
- New Sparse Agreement Testers
- Parallel Computation of Greatest Common Divisors of Polynomials
- The Social Golfer Problem (and other Scheduling Problems)
- Bilateral Rational Ramanujan Series and their p-adic Mates
- Weak Recovery Threshold for the Hypergraph Stochastic Block Model
- The Complexity of Dynamic Least-Squares Regression
- Take Shortcuts if you Must, but Make Them Few and Make Them Good!
- Studying the Area under (Generalized) Dyck Paths
- Essentially Tight Bounds for Rainbow Cycles in Proper Edge-Colourings
- Crossings, Incidences, and Unit Triangles (A Story with a Happy Ending)
- Extracting Randomness from Samplable Distributions, Revisited
- Misinformation on Encrypted Social Media: Challenges and Mitigation Strategies
- Anticoncentration via the Strong Perfect Graph Theorem
- The Discrepancy of Shortest Paths
- Graph Containers
- Reinforcement Learning and Pattern Finding in Combinatorics
- Generalized Ray-Knight Theorems: Their Applications and Limitations
- The Price of Explainability for Clustering
- (Virtual) Knot Theory and Diagrams
- Resolution of the Kohayakawa--Kreuter Conjecture
- Applications of Tensor Rank to Algorithm Design Beyond Fast Matrix Multiplication
- Spread Colorings
- Eric Angelini's Comma Sequence Part 2
- Fast Algorithms for Cactus Representation of Minimum Cuts
- Uniform Spanning Tree
- The Challenges and Opportunities in Game Theory for Security
- Local Structure of Graphs of Large K_r-free Chromatic Number
- Beyond Worst-case Guarantees for Sequential Prediction: Robustness via Abstention
- Four Proofs of Subset Sums
- Effectively Multiplication- and Division-Free Residue Number Systems
- An Exotic Growth Rate in Ramsey Theory
- Fourier Growth of Communication Protocols for XOR Functions
- Modern Generative AI and its implications for the future
- Fair Claims Resolution
- Complexity of combinatorial log-concave inequalities
- Metric Distortion in Social Choice
- Fair Secretaries with Unfair Predictions
- Dick Askey (1933-2019) and What I've Learned About Him and His Life
- Turan Densities for Daisies and Hypercubes
- Posets, Antichains, and LYM
- New Spectral Techniques in Algorithms and Coding Theory: the Kikuchi Matrix Method
- Searching for Sequences: Irrationality Beyond Apery
- Toward Fairer Multimodal Information Systems
- Inequalities for Connectivity Events in Bernoulli Percolation
- Quasi-Linear Size PCPs with Small Soundness from High-Dimensional Expanders
- Symmetries of Tilings
- A Two-Variable Vandermonde Decomposition of q-Binomials Emerging from a Complex Dynamics Problem
- Signed Permutohedra
- Optimal Stopping with Interdependent Values
- Convex Corners and Packing Polytopes
- Induced Subdivisions and Polylogarithmic Chromatic Number
- Fair Allocation of a Conflict Graph
- Not All Strings Can Be Short Kings
- A Nasty Surprise in a Sequence, and Other Recent OEIS Stories
- Worst-Case VCG Redistribution Mechanism Design Based on the Lottery Ticket Hypothesis
- Data Analytics at USCIS Perspectives that are 5 years out of date
- Latin Squares, Take 2
- The Online Submodular Assignment Problem
- Dominique Foata, A Classical Combinatorist Par Excellence
- Cutoff for the Biased Random Transposition Shuffle
- Nearly Optimal List Labeling
- Greedy Algorithms
- The Experimental Geometer: How John Wallis Saved Mathematics for the Royal Society
- Spectral Bounds on the Independence Number
- Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
- The Small Quasikernel Conjecture
- Finding the Jewel in the Lotus
- From Algorithmic and RL-based to LLM-powered Agents
- Lipschitz Functions on Expanders
- Online Mechanism Design with Predictions
- Combinatorial Characteristics of the Continuum
- q-Factorization of Power Series
- Large Random Matrices with Given Margi
- On the Sudden Death of Thermal Entanglement
- Entropy: The Basic Method and Some Quick Applications to Combinatorics
- Odds and Evens: Enumeration Results for the Alternating Subgroup
- Extremal Problems for Random Objects
- Privately Estimating a Gaussian: Efficient, Robust and Optimal
- How Can We Define Prime Vector Parking Functions?
- Games Played Randomly-Chomp and Nim
- On Perfectly Friendly Bisections of Random Graphs
- Ramsey and Turán Numbers of Sparse Hypergraphs
- Modern Expander-Based Error-Correcting Codes
- Graph Constructions
- Combinatorial Structure Behind Sinkhorn Limits
- Cyber Threats in the Port of New York and New Jersey
- Chow Functions for Partially Ordered Sets
- Ghost Value Augmentation for k-Edge Connectivity
- Enumeration of Corner Polyhedra
- Eric Angelini's Greatest Sequences
- Discrete Geometry via Semialgebraic Graphs
- On the Search to Settle the Complexity of Approximating Directed Steiner Tree
- Picking, Posing and Attacking Natural Problems in Discrete Mathematics: from Insightful Bijections to Black-box Help from Machine Learning
- Erdős Unit Distance Problem and Graph Rigidity
- Constant Rate Isometric Embedding of Hamming Metric into Edit Metric
- A Map of the Holonomic Forest - Searching for Irrationality with Conservative Matrix Fields
- Balancing Extensions in Posets of Large Width
- Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
- Resurgent Integer Sequences
- Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
- Ramsey Theory on Infinite Linear Orders
- A Mirror Step Variant of Gambler's Ruin
- Posets with Unbounded Saturation Number
- Learning with Drifting Input Distributions
- Ascent Sequences Avoiding a Set of Length-3 Patterns
- Random Cayley Graphs and Additive Combinatorics from a Combinatorial Perspective
- A Tight VC-dimension Analysis of Clustering Coresets
- Some Background on Convex Discrete Geometry
- Young Tableau Reconstruction Via Minors
- Finding Regular Subgraphs
- Sensitivity Sampling for Coreset-Based Data Selection
- 2-connected Graphs, 3-connected Graphs, and K-blocks
- The Mathematics of Adriano Garsia (1928-2024)
- Speyer's Tropical F-vector Conjecture and its Proof
- Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint
- Covering the Hypercube with Hyperplanes
- A Central Limit Theorem in the Framework of the Thompson Group F
- Cognitive and Motivational Determinants of Normalcy Bias
- Probability Spaces Driven by Geometric Constraints
- A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization
- Combinatorial Exploration and Permutation Classes
- A Necessary and Sufficient Condition for $k$-transversals
- Random Packings
- Communication Complexity of Load Balancing via Matching Contractors
- Some Positivity Conjectures for Symmetric Functions Motivated by Classical Theorems from the Analytic Theory of Polynomials
- Connections Between Graphs and Matrix Spaces
- Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
- Parking Functions with a Fixed Set of Lucky Cars
- Mini-course on Quantum Recursive Programs
- Szemerédi’s Theorem, Primes, and Nilsequences
- Mini-course on Quantum Recursive Programs
- Catalan Numbers and Topological Recursion (pt. 2)
- All-Pairs Max-Flow vs. All-Pairs Shortest-Path
- Some Surprises in Lattice Problems
- Quantum Tomography: Schur-Weyl to Pauli, 4 to 10
- Optimal Resource Capacity Management for Stochastic Networks
- Categorification in Knot Theory and Graph Theory
- Modular Arithmetic with Trinomial Moduli
- Streamlining Equal Shares
- Resilience Patterns in Dynamic Aircraft-to-Aircraft Communication Networks
- Hitting Time Mixing for the Random Transposition Walk
- Credible Decentralized Exchange Design via Verifiable Sequencing Rules
- Generating Functions of Sequences Relating to Spanning Trees in Certain Graph Families; Experimenting with Permutation Wordle
- Ranks and Graphs
- Fully Packed and Ready to Go: Eliminating Rearrangement in High-Density, Grid-based Storage
- The Mathematics and Physics of Joel Lebowitz
- Supply Chain Intelligence - Uniting the Silos of Excellence
- Complexity in the Era of AI and Data-Driven Computing
- Distinguished Lecture Series, Lance Fortnow (Illinois Institute of Technology): Complexity in the Era of AI and Data-Driven Computing
- Mechanism Design in the Real World
- Towards accurate, scalable, and efficient quantum chemistry simulation
- In the footsteps of Heraclitus
- Formalizing mathematics with Lean and Mathlib
- Bridging ML and Formal Methods for Trustworthy Network Management
- The Versatile Forman-Ricci Curvature and its Networks Applications
- Complexity of Tarski Fixed Points
- Cutting a Pancake Using an Exotic Knife
- Random Combinatorial Billiards and Stoned Exclusion Processes
- Locally Sampleable (Uniform) Symmetric Distributions
- IMO 2025 Problem 6
- A Heuristic Link between Divisor Counts and Prime Densities in Sequence
- New Constructions and Bounds for Nonabelian Sidon Sets with Applications to Turán-type Problems
- High Dimensional Online Calibration in Polynomial Time
- A Journey with MacMahon and Ramanujan Series
- Some Easy Optimization Problems Have the Overlap-gap Property
- An Introduction to Lean + AI for Research Mathematicians
- Planting Trees for Combinatorial Geometry-Oriented Teens
- Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
- H-Intersecting Families of Graphs
- Okey and Random Combinatorial Games
- Aldous-type Spectral Gaps in Unitary Groups
- Low Cost, Fair, and Representative Committees in a Metric Space
- Decentralized Mechanism Design
- Power and Limitations of Aggregation in Compound AI Systems
- Convex Bodies and their Lattice Points
- A Survey on AI for Proof Assistants
- Identity Found by Proving Identities
- The Oddtown Problem Modulo a Composite Number
- TBA
- Goedel-Prover-V2: The Strongest Open-Source Theorem Prover to Date
- Borel Chromatic Number of Graphs
- Computer Algebra Tools for Feynman Integrals
- VC-dimension for hypergraphs: improved bounds
- Algorithmic Contract Design
- Isolating Solutions
- LLM-ERM: Sample-Efficient Program Learning via LLM-Guided Search
- Powers of 2 in Balanced Grid Colourings
- Triangle-Ramsey Numbers of Complete Graphs
- Multi-Pass Streaming Lower Bound for Max-Cut
- O-Forge: A Verifiable, LLM-driven Framework for Proving Inequalities in Research Mathematics
- Cutting Rectangles into Two Congruent Pieces
- Mutually Touching Infinite Cylinders and Ramsey TheoryÂ
- Sparse Navigable Graphs for Nearest Neighbor Search
- Longest Cycles in 2-connected Graphs
- DeRL: Diverse Exploration Reinforcement Learning for Large Language Models
- Maximizing the Number of Integer Pairs Summing to Powers of 2 via Graph Labeling and Solving Restricted Systems of Linear (in)equations
- Assortment Optimization for Patient-Provider Matching
- Tree Reconstruction from Noisy Triplet Queries: Hierarchical Clustering and Beyond
- A Variational-Calculus Approach to Online Algorithm Design and Analysis
- (Non)commutative Integrable Systems and Catalan Numbers
- Game Theory, Data Analytics, and Homeland Security
- Hypercube Turán Problems
- List Colorings of Graphs and the List-Coloring Conjecture
- Gödel in Cryptography: Zero-Knowledge Proofs with No Interaction, No Setup, and Perfect Soundness
- Verina: Benchmarking Verifiable Code Generation
- Continuous Parking Sequences
- Equilibrium Beyond Prices: Algorithmic Markets, Strategic Multi-agents, and Economics for Digital Social Economic Systems
- Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler
- Hybrid Learning Machines Bridge AI and Physical Modeling
- Guessing with Little Data
- Robust Local Testability of Tensor Products of Algebraic Geometry Codes
- Multiparty Distributed Point Functions
- Mathematically Inspired Musical Scales
- Alignment From Imperfect Data - Incentives, Evaluation, and Decision-Making
- As Hard as it Gets: Hardness Amplification and Local List Decoding from HDX
- Domino Tilings
- Mechanical Proofs of Partition Identities Through Atomic Relations
- The Turán Density of Tight Cycles
- An Exact Algorithm for the Unanimous Vote Problem
- Large Gaps Between Primes
- Counting Colored Tilings on Grids and Graphs
- The Structure of Large Intersecting Families in Vector Spaces
- New Perspectives on Learning Networks from Dynamics
- Embedding Spanning Trees in the Random Graph
- Game theory, Scrabble, and poisons
- Bellman-Ford in Almost-Linear Time for Dense Graphs
- Tangles in Graphs
- How Many Coin Tosses Would You Need Until You Get n Heads or m Tails?
- Thinking Outside the Ballot Box
- Triangle-free Graphs and the Odd Hadwiger Conjecture
- Online Algorithms for Multi-agent Exploration
- A Combinatorial Lane Merging Problem
- A Computational Approach to Improving Bounds on the Hales-Jewett Numbers
- The Liquid-vapor Phase Transition in a System with a Finite but Coarse-grained Attraction
- Adversarial Robustness on Insertion-Deletion Streams
- Crystalline Order in Random Packings of Z-pentominoes on the Square Lattice
- Counting Colored Trees
- Generalized Tur\'an Problems for Trees and More
- The State of Fox's Trapezoidal Conjecture
- Locality Sensitive Hashing in Hyperbolic Space
- Partial Associativity in Latin Squares
- A Polynomial Space Lower Bound for Diameter Estimations in Dynamic Streams
- A Brief Intro to Discrete Fourier Analysis.
- Summing a Challenging Series
- Diversity Preserving Filter Pruning: A Fast Optimization Approach for Practical Neural Network Compression
- Sparse and Scalable Residue Number Systems from Polynomial Point of View
- Quasipolynomial Bounds for the Corners Theorem
- Ultraproducts of Graphs
- From Visual Computing to Convergence Research: Transforming the Cyber-Physical-Material Landscape with AI
- Computational and Experimental Methods in Permutation Patterns
- Bridging High-Dimensional Robust Statistics and Non-Convex Optimization
- Necklaces and Subset Sums
- In Defense of Defensive Forecasting
- Use of Computers in Mathematical Research
- Permutation Groups, Partition Lattices and Block Structures
- Vanishing First Homology Groups of Clique Complexes of Strongly Regular Graphs
- Learning Conditional Averages Over Neighborhood Graphs
- On the Mathematical Legacy of Guillera
- The Entropy Method and the Mixture Bound
- Fourier Analysis and Arithmetic Progressions
- Sublinear-Time Lower Bounds for Approximating Size using Non-Adaptive Queries (SODA 2026)
- One Century of the Wave Mechanics Discovery by Louis de Broglie, Werner Heisenberg, Erwin Schrodinger, and Paul A.M. Dirac
- Fair Division of Indivisible Items by Allocating Large Items First
- Automating Quantum Algorithm Construction with qLA
- Quantum Algorithm Construction with qLA
- Fair Division of Indivisible Items by Allocating Large Items First
- Von Neumann Poker with Finite Decks
- Some Interesting Unsolved Problems Concerning Number Sequences
- Computing Pi by tossing a coin
- Highlights from the First 400,000 Sequences in the OEIS
- Double Deficiencies in Permutations With and Without Pattern Avoidance
- Why the Riemann hypothesis is ill-posed
- Bootstrap Percolation and Partial Difference Equations
- Meetings
- Seminars - test
- Workshop on AI Powered Automation at Ports
- Contact Us
