Space Kitty Archive

Algorithms & Complexity Breakthroughs

Almost-linear-time max flow, shortest paths beyond Dijkstra's sorting barrier, matrix multiplication exponent improvements and space-time simulation results.

192 papersnewest Oct 25, 2026

Most influential

  • Droplet formation and breakup dynamics in microfluidic flow-focusing devices: From dripping to jetting
    Taotao Fu, Yining Wu, Youguang Ma et al. · 2012 · Chemical Engineering Science
    Article313 citationsdoi:10.1016/j.ces.2012.08.039
  • Stomatal Function across Temporal and Spatial Scales: Deep-Time Trends, Land-Atmosphere Coupling and Global Models
    Peter J. Franks, Joseph A. Berry, Danica Lombardozzi et al. · 2017 · PLANT PHYSIOLOGY

    The colonization of land by plants and their interaction with biogeochemical and atmospheric processes transformed continental climate and hydrology. Stomata, which evolved to optimize the biological economics of plant carbon uptake in exchange for water loss, play a crucial role in large-scale environmental processes by maintaining a connection between deep…

    Abstract excerpt by Peter J. Franks et al., CC-BY, https://doi.org/10.1104/pp.17.00287; truncated.

    Article159 citationsdoi:10.1104/pp.17.00287
  • A thermodynamic approach to link self-organization, preferential flow and rainfall–runoff behaviour
    Erwin Zehe, Uwe Ehret, Theresa Blume et al. · 2013 · Hydrology and earth system sciences

    Abstract. This study investigates whether a thermodynamically optimal hillslope structure can, if existent, serve as a first guess for uncalibrated predictions of rainfall–runoff. To this end we propose a thermodynamic framework to link rainfall–runoff processes and dynamics of potential energy, kinetic energy and capillary binding energy in catchments and h…

    Abstract excerpt by Erwin Zehe et al., CC-BY, https://doi.org/10.5194/hess-17-4297-2013; truncated.

    Article80 citationsdoi:10.5194/hess-17-4297-2013
  • Closed loop supply chain networks: Designs for energy and time value efficiency
    Dinesh K. Kadambala, Nachiappan Subramanian, Manoj Kumar Tiwari et al. · 2016 · International Journal of Production Economics
    Article79 citationsdoi:10.1016/j.ijpe.2016.02.004
  • Fast Approximate Shortest Paths in the Congested Clique
    Keren Censor-Hillel, Michal Dory, Janne H. Korhonen et al. · 2019 · Distributed Computing

    We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+ε)$-approximation for all-pairs shortest paths in $O(\log^2{n} / ε)$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial co…

    Article43 citationsarXiv:1903.05956doi:10.1007/s00446-020-00380-5
  • CUDA programs for solving the time-dependent dipolar Gross–Pitaevskii equation in an anisotropic trap
    Vladimir Lončar, Antun Balaž, Aleksandar Bogojević et al. · 2015 · Computer Physics Communications

    In this paper we present new versions of previously published numerical programs for solving the dipolar Gross-Pitaevskii (GP) equation including the contact interaction in two and three spatial dimensions in imaginary and in real time, yielding both stationary and non-stationary solutions. New versions of programs were developed using CUDA toolkit and can m…

    Article62 citationsarXiv:1601.04640doi:10.1016/j.cpc.2015.11.014
  • A new finite element formulation for viscoelastic flows: Circumventing simultaneously the LBB condition and the high-Weissenberg number problem
    Stylianos Varchanis, Alexandros Syrakos, Yannis Dimakopoulos et al. · 2019 · Journal of Non-Newtonian Fluid Mechanics
    Article59 citationsdoi:10.1016/j.jnnfm.2019.04.003
  • OpenMP, OpenMP/MPI, and CUDA/MPI C programs for solving the time-dependent dipolar Gross–Pitaevskii equation
    Vladimir Lončar, Luis E. Young-S., Srdjan Škrbić et al. · 2016 · Computer Physics Communications

    We present new versions of the previously published C and CUDA programs for solving the dipolar Gross-Pitaevskii equation in one, two, and three spatial dimensions, which calculate stationary and non-stationary solutions by propagation in imaginary or real time. Presented programs are improved and parallelized versions of previous programs, divided into thre…

    Article59 citationsarXiv:1610.05329doi:10.1016/j.cpc.2016.07.029
  • Modelling of fully-coupled CO2 diffusion and adsorption-induced coal matrix swelling
    K.H.S.M. Sampath, M.S.A. Perera, Stephan Konrad Matthai et al. · 2019 · Fuel
    Article57 citationsdoi:10.1016/j.fuel.2019.116486
  • A Survey of Shortest-Path Algorithms
    Amgad Madkour, Walid G. Aref, Faizan Ur Rehman et al. · 2017

    A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this taxonomy is the vario…

    Preprint58 citationsarXiv:1705.02044
  • Improved Distributed Algorithms for Exact Shortest Paths
    Mohsen Ghaffari, Jason Li · 2017 · ACM Symposium on Theory of Computing (STOC)

    Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et al. [DISC'17] which deterministically computes $(1+o(1))$-approximate shortest paths in $\tilde O(D+\sqrt n…

    Article54 citationsarXiv:1712.09121doi:10.1145/3188745.3188948
  • Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow
    Li Chen, Rasmus Kyng, Yang P. Liu et al. · 2023 · ACM Symposium on Theory of Computing (STOC)

    We give the first almost-linear time algorithms for several problems in incremental graphs including cycle detection, strongly connected component maintenance, $s$-$t$ shortest path, maximum flow, and minimum-cost flow. To solve these problems, we give a deterministic data structure that returns a $m^{o(1)}$-approximate minimum-ratio cycle in fully dynamic g…

    Article12 citationsarXiv:2311.18295doi:10.1145/3618260.3649745
  • Non‐linear quickflow response as indicators of runoff generation mechanisms
    Charles I. Scaife, Nitin K. Singh, R. E. Emanuel et al. · 2020 · Hydrological Processes
    Article48 citationsdoi:10.1002/hyp.13780
  • Experimental investigation of frost formation on a parallel flow evaporator
    Jianghong Wu, Guang Ouyang, Puxiu Hou et al. · 2010 · Applied Energy
    Article53 citationsdoi:10.1016/j.apenergy.2010.11.006
  • Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
    Li Chen, Rasmus Kyng, Yang P. Liu et al. · 2022

    We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a sequence of $m^{1+o(1)}$ approximate undirected minimum-ratio cycles, each of which is computed and processed in amortize…

    Preprint12 citationsarXiv:2203.00671

Newest work

Full ranked list (JSON) →