Browser does not support script.
Skip to content
London School of Economics and Political Science
Search
Menu
Department of Mathematics
Toggle navigation
EDI
About Us
People
Prospective Students
Current Students
Alumni
Research
Research Students
Events and Seminars
News
Trending at LSE
LSE Data Analytics Career Accelerator: How to get a career in data
Information for international students
Graduate degrees: fees and funding
Graduate degrees: available programmes 2024/25
Careers
Students at LSE Blog
Apply
Got an admissions question? Check our Admissions Knowledge Base
Study at LSE
Undergraduate
Graduate
Executive Education
Online courses
Summer School
Study abroad
Student life
Accommodation
Research
Discover our research
LSE Blogs
Research for the World online magazine
LSE Press
Find LSE academics
Research centres
Understanding Global Politics
Understanding the UK Economy
Our REF 2021 results
News & events
Latest news
Upcoming events
LSE Festival June 2024
Films & podcasts
Media queries
About LSE
An introduction
Our Campaign
Our strategy
LSE leadership
Departments & institutes
Divisions
Library
Members of CIVICA
Term dates
Contact us
Quick links for
Current students
Find support for students at LSE
Paying fees
Staff
Jobs at LSE
Alumni & friends
Business & employers
COVID-19 information
Close
Search
Go
Department of Mathematics
Research
Publications
Publications
Below is the list of the Department's recent research publications. This information is generated by an RSS feed from LSE Research Online, and shows the most recent 20 publications (either published, or accepted for publication).
Minimum curvature flow and martingale exit times
Larsson, Martin and Ruf, Johannes ORCID: 0000-0003-3616-2194
(2024) Minimum curvature flow and martingale exit times. Electronic Journal of Probability. ISSN 1083-6489 (In Press)
On circuit diameter bounds via circuit imbalances
Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X
(2024) On circuit diameter bounds via circuit imbalances. Mathematical Programming. ISSN 0025-5610 (In Press)
A first order method for linear programming parameterized by circuit imbalance
Cole, Richard, Hertrich, Christoph ORCID: 0000-0001-5646-8567
, Tao, Yixin and Végh, László A. ORCID: 0000-0003-1152-200X
(2024) A first order method for linear programming parameterized by circuit imbalance. In: Vygen, Jens and Byrka, Jarosław, (eds.) Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, pp. 57-70. ISBN 9783031598340
Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2024) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. Algorithmica. ISSN 0178-4617
Introduction aux sciences économiques
Gossner, Olivier, Michau, Jean-Baptiste and Rollet, Vincent (2024) Introduction aux sciences économiques. Éditions Economica, Paris, FR. ISBN 9782717872873
Short communication: dynamic default contagion in heterogeneous interbank systems
Feinstein, Zachary and Sojmark, Andreas ORCID: 0000-0001-7488-0221
(2021) Short communication: dynamic default contagion in heterogeneous interbank systems. SIAM Journal on Financial Mathematics, 12 (4). SC83-SC97. ISSN 1945-497X
The economic limits of permissionless consensus
Budish, Eric, Lewis-Pye, Andrew and Roughgarden, Tim (2024) The economic limits of permissionless consensus. ACM Transactions on Economics and Computation. ISSN 2167-8375 (In Press)
A friendly approach to complex analysis
Sasane, Sara Maad and Sasane, Amol (2023) A friendly approach to complex analysis. World Scientific (Firm). ISBN 9789811272806
Training fully connected neural networks is ∃R-complete
Bertschinger, Daniel, Hertrich, Christoph ORCID: 0000-0001-5646-8567
, Jungeblut, Paul, Miltzow, Tillmann and Weber, Simon (2023) Training fully connected neural networks is ∃R-complete. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M. and Levine, S., (eds.) Advances in Neural Information Processing Systems 36 (NeurIPS 2023). Neural Information Processing Systems Foundation.
Online throughput maximization on unrelated machines: commitment is no burden
Eberle, Franziska, Megow, Nicole and Schewior, Kevin (2023) Online throughput maximization on unrelated machines: commitment is no burden. ACM Transactions on Algorithms, 19 (1). ISSN 1549-6325
Provably good solutions to the knapsack problem via neural networks of bounded size
Hertrich, Christoph ORCID: 0000-0001-5646-8567
and Skutella, Martin (2023) Provably good solutions to the knapsack problem via neural networks of bounded size. Informs Journal on Computing, 35 (5). 1079 - 1097. ISSN 1091-9856
On a class of strategy-proof social choice correspondences with single-peaked utility functions
Ingalagavi, Chinmay and Sadhukhan, Soumyarup (2023) On a class of strategy-proof social choice correspondences with single-peaked utility functions. Journal of Mathematical Economics, 109. ISSN 0304-4068
Granular DeGroot dynamics -- a model for robust naive learning in social networks
Amir, Gideon, Arieli, Itai, Ashkenazi-Golan, Galit and Peretz, Ron (2022) Granular DeGroot dynamics -- a model for robust naive learning in social networks. In: Proceedings of the 23rd ACM Conference on Economics and Computation. ACM Press, pp. 323-324. ISBN 9781450391504
Discounted nonzero-sum optimal stopping games under Poisson random intervention times
Gapeev, Pavel V. (2024) Discounted nonzero-sum optimal stopping games under Poisson random intervention times. Stochastics: an International Journal of Probability and Stochastic Processes. ISSN 1744-2508
Dehumanisation and the future of technology
Oldfield, M. (2023) Dehumanisation and the future of technology. In: International Conference on AI and the Digital Economy. Institution of Engineering and Technology, 61 - 67. ISBN 978-1-83953-959-6
Lumiere: making optimal BFT for partial synchrony practica
Lewis-Pye, Andrew, Malkhi, Dahlia, Naor, Oded and Nayak, Kartik (2024) Lumiere: making optimal BFT for partial synchrony practica. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (PODC 2024). ACM Press.
Balanced supersaturation for some degenerate hypergraphs
Corsten, Jan and Tran, Tuan (2021) Balanced supersaturation for some degenerate hypergraphs. Journal of Graph Theory, 97 (4). pp. 600-623. ISSN 0364-9024
Embedding loose spanning trees in 3-uniform hypergraphs
Pehova, Yani and Petrova, Kalina (2024) Embedding loose spanning trees in 3-uniform hypergraphs. Journal of Combinatorial Theory, Series B, 168. 47 - 67. ISSN 0095-8956
Arc connectivity and submodular flows in digraphs
Abdi, Ahmad ORCID: 0000-0002-3008-4167
, Cornuéjols, Gérard and Zambelli, Giacomo (2024) Arc connectivity and submodular flows in digraphs. Combinatorica. ISSN 0209-9683
Larsson, Ramdas, and Ruf’s contribution to the Discussion of Safe Testing by Grünwald, de Heide, and Koolen
Larsson, Martin, Ramdas, Aaditya and Ruf, Johannes ORCID: 0000-0003-3616-2194
(2024) Larsson, Ramdas, and Ruf’s contribution to the Discussion of Safe Testing by Grünwald, de Heide, and Koolen. Journal of the Royal Statistical Society. Series B: Statistical Methodology. ISSN 1369-7412 (In Press)
Share
Email a link to this page
Share on Facebook
Share on LinkedIn
CDAM Research Report Series
from 1991 - 2009
Browser does not support script.
Browser does not support script.
Browser does not support script.
Browser does not support script.
Browser does not support script.
Browser does not support script.