<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>"SIAM Journal on Computing" on 2010-05-26 12:45 PM</title>
    <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;bquery=JN+%26quot%3bSIAM+Journal+on+Computing%26quot%3b&amp;site=ehost-live&amp;scope=site</link>
    <description>EBSCO Syndicated Feed for ""SIAM Journal on Computing" on 2010-05-26 12:45 PM" Alert</description>
    <copyright>2016 EBSCO Information Services</copyright>
    <image>
      <url>http://content.ebscohost.com/static/ebscoimages/12.3.23.0/ehost/logoEhost.gif</url>
      <title>"SIAM Journal on Computing" on 2010-05-26 12:45 PM</title>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;bquery=JN+%26quot%3bSIAM+Journal+on+Computing%26quot%3b&amp;site=ehost-live&amp;scope=site</link>
    </image>
    <pubDate>Mon, 15 Jun 2026 04:19:01 GMT</pubDate>
    <ttl>1440</ttl>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007944&amp;site=ehost-live</link>
      <author>Jäger, Sven; Lindermayr, Alexander; Megow, Nicole</author>
      <category>Scheduling</category>
      <category>Computer scheduling</category>
      <category>Algorithms</category>
      <category>Resource allocation</category>
      <category>Matching theory</category>
      <category>Mathematical analysis</category>
      <title>The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007944); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007944</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007938&amp;site=ehost-live</link>
      <author>Pettie, Seth; Saranurak, Thatchaphol; Yin, Longhui</author>
      <category>Graph connectivity</category>
      <category>Data structures</category>
      <category>Graph theory</category>
      <category>Graph algorithms</category>
      <category>Computational complexity</category>
      <title>Space Complexity of Vertex Connectivity Oracles.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007938); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007938</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007939&amp;site=ehost-live</link>
      <author>Das, Bireswar; Thakkar, Dhara</author>
      <category>Permutation groups</category>
      <category>Algorithms</category>
      <category>Computational complexity</category>
      <category>Finite groups</category>
      <category>Representations of groups (Algebra)</category>
      <title>The Minimal Faithful Permutation Degree of Groups Without Abelian Normal Subgroups.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007939); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007939</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007940&amp;site=ehost-live</link>
      <author>Chen, Liyan; Ezra, Tomer; Feldman, Michal; Gravin, Nick; Sun, Nuozhou; Tang, Zhihao Gavin</author>
      <category>Online algorithms</category>
      <category>Bayesian analysis</category>
      <category>Optimal stopping (Mathematical statistics)</category>
      <category>Deterministic algorithms</category>
      <category>Thresholding algorithms</category>
      <title>Order-Competitive Ratio.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007940); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007940</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007943&amp;site=ehost-live</link>
      <author>Draganić, Nemanja; Nenadov, Rajko</author>
      <category>Graph theory</category>
      <category>Online algorithms</category>
      <category>Graph connectivity</category>
      <category>Deterministic algorithms</category>
      <category>Directed graphs</category>
      <category>Polynomial time algorithms</category>
      <title>Edge-Disjoint Paths in Expanders: Online with Removals.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007943); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007943</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007942&amp;site=ehost-live</link>
      <author>An, Dong; Childs, Andrew M.; Lin, Lin; Ying, Lexing</author>
      <category>Laplace transformation</category>
      <category>Matrix inversion</category>
      <category>Differential equations</category>
      <category>Quantum computing</category>
      <category>Quantum superposition</category>
      <category>Computational complexity</category>
      <title>Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007942); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007942</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=194007941&amp;site=ehost-live</link>
      <author>Colin de Verdière, Éric; Magnard, Thomas</author>
      <category>Graph theory</category>
      <category>Dynamic programming</category>
      <category>Computational complexity</category>
      <category>NP-hard problems</category>
      <title>An FPT Algorithm for the Embeddability of Graphs Into Two-Dimensional Simplicial Complexes.</title>
      <description>SIAM Journal on Computing; 03/01/2026&lt;br/&gt;(AN 194007941); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Mar 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_194007941</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988878&amp;site=ehost-live</link>
      <author>Chen, Xi; Li, Yuhao; Yannakakis, Mihalis</author>
      <category>Fixed point theory</category>
      <category>Monotonic functions</category>
      <category>Computational complexity</category>
      <category>Mathematical functions</category>
      <title>Reducing Tarski to Unique Tarski (In the Black-Box Model).</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988878); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988878</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988877&amp;site=ehost-live</link>
      <author>Bhargava, Vishwas; Saraf, Shubhangi; Volkovich, Ilya</author>
      <category>Polynomials</category>
      <category>Algorithms</category>
      <category>Vandermonde matrices</category>
      <category>Linear dependence (Mathematics)</category>
      <category>Circuit complexity</category>
      <title>Linear Independence, Alternants and Applications.</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988877); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988877</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988876&amp;site=ehost-live</link>
      <author>Dütting, Paul; Fusco, Federico; Lazos, Philip; Leonardi, Stefano; Reiffenhäuser, Rebecca</author>
      <category>Game theory</category>
      <category>Approximation algorithms</category>
      <title>Efficient Two-Sided Markets with Limited Information.</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988876); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988876</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988880&amp;site=ehost-live</link>
      <author>Apers, Simon; Gribling, Sander</author>
      <category>Linear programming</category>
      <category>Interior-point methods</category>
      <category>Newton-Raphson method</category>
      <category>Quantum computing</category>
      <category>Mathematical optimization</category>
      <category>Hessian matrices</category>
      <title>Quantum Speedups for Linear Programming via Interior Point Methods.</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988880); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988880</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988879&amp;site=ehost-live</link>
      <author>Low, Guang Hao; Su, Yuan</author>
      <category>Quantum computing</category>
      <category>Linear algebra</category>
      <category>Hermitian operators</category>
      <category>Differential equations</category>
      <category>Polynomial operators</category>
      <title>Quantum Eigenvalue Processing.</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988879); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988879</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=191988881&amp;site=ehost-live</link>
      <author>Guruswami, Venkatesan; Hsieh, Jun-Ting; Raghavendra, Prasad</author>
      <category>Subspaces (Mathematics)</category>
      <category>Algorithms</category>
      <category>Computational complexity</category>
      <title>Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the \(\boldsymbol{\sqrt {n}}\) Dimension Threshold.</title>
      <description>SIAM Journal on Computing; 01/01/2026&lt;br/&gt;(AN 191988881); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jan 2026 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_191988881</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610298&amp;site=ehost-live</link>
      <author>Dütting, Paul; Ezra, Tomer; Feldman, Michal; Kesselheim, Thomas</author>
      <category>Submodular functions</category>
      <category>Contract theory</category>
      <category>Labor incentives</category>
      <title>Combinatorial Contracts.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610298); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610298</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610299&amp;site=ehost-live</link>
      <author>Friggstad, Zachary; Khodamoradi, Kamyar; Salavatipour, Mohammad R.</author>
      <category>K-means clustering</category>
      <category>Euclidean metric</category>
      <category>Clustering algorithms</category>
      <category>Mathematical optimization</category>
      <category>Polynomial time algorithms</category>
      <category>Computational complexity</category>
      <category>Heuristic</category>
      <title>Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \(\boldsymbol{k}\)-means.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610299); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610299</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610300&amp;site=ehost-live</link>
      <author>Kaplan, Haim; Naori, David; Raz, Danny</author>
      <category>Online algorithms</category>
      <category>Optimal stopping (Mathematical statistics)</category>
      <category>Stochastic models</category>
      <category>Comparative studies</category>
      <title>Competitive Analysis with a Sample and the Secretary Problem.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610300); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610300</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610302&amp;site=ehost-live</link>
      <author>Zhuk, Dmitriy</author>
      <category>Constraint satisfaction</category>
      <category>Computational complexity</category>
      <category>Duality theory (Mathematics)</category>
      <category>Constraint programming</category>
      <title>\(\boldsymbol{\Pi_2^P}\) vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610302); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610302</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610296&amp;site=ehost-live</link>
      <author>Kwok, Tsz Chiu; Lau, Lap Chi; Tung, Kam Chuen</author>
      <category>Laplacian matrices</category>
      <category>Graph theory</category>
      <category>Approximation algorithms</category>
      <category>Spectral theory</category>
      <category>Eigenvalues</category>
      <category>Bipartite graphs</category>
      <category>Graph connectivity</category>
      <title>Cheeger's Inequalities for Vertex Expansion and Reweighted Eigenvalues.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610296); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610296</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610301&amp;site=ehost-live</link>
      <author>Blais, Eric; Seth, Cameron</author>
      <category>Graph coloring</category>
      <category>Graph theory</category>
      <category>Random graphs</category>
      <category>Combinatorics</category>
      <category>Sample size (Statistics)</category>
      <title>Testing Graph Properties with the Container Method.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610301); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610301</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=190610297&amp;site=ehost-live</link>
      <author>Le, Hung; Solomon, Shay</author>
      <category>Graph theory</category>
      <category>Computational geometry</category>
      <category>Euclidean geometry</category>
      <category>Algorithms</category>
      <title>A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions.</title>
      <description>SIAM Journal on Computing; 11/01/2025&lt;br/&gt;(AN 190610297); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Nov 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_190610297</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718084&amp;site=ehost-live</link>
      <author>Chen, Lijie; Golovnev, Alexander; Le Nguyen, Huy</author>
      <category>Computer science</category>
      <category>Conferences &amp; conventions</category>
      <title>Special Section on The Sixty-Third Annual IEEE Symposium on Foundations of Computer Science (2022).</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718084); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718084</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718080&amp;site=ehost-live</link>
      <author>Meir, Or</author>
      <category>Computational complexity</category>
      <category>Circuit complexity</category>
      <category>Communication complexity (Information theory)</category>
      <category>Mathematical functions</category>
      <title>Toward Better Depth Lower Bounds: A KRW-like Theorem For Strong Composition.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718080); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718080</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718070&amp;site=ehost-live</link>
      <author>Klimm, Max; Warode, Philipp</author>
      <category>Computational complexity</category>
      <category>Equilibrium</category>
      <category>Cost functions</category>
      <category>Traffic flow</category>
      <category>Laplacian operator</category>
      <category>Laplacian matrices</category>
      <title>Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718070); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718070</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718082&amp;site=ehost-live</link>
      <author>Wang, Qisheng; Zhang, Zhicheng</author>
      <category>Gibbs sampling</category>
      <category>Information theory</category>
      <category>Quantum computing</category>
      <category>Quantum entropy</category>
      <title>Quantum Lower Bounds by Sample-to-Query Lifting.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718082); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718082</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718083&amp;site=ehost-live</link>
      <author>Bender, Michael A.; Fineman, Jeremy T.; Gilbert, Seth; Kuszmaul, John; Young, Maxwell</author>
      <category>Telecommunication channels</category>
      <category>Data transmission systems</category>
      <category>Interference suppression</category>
      <category>Adaptive control systems</category>
      <category>Mathematical optimization</category>
      <category>Interference (Telecommunication)</category>
      <title>Jamming-Resistant Backoff with Polylogarithmic Sending and Listening Cost.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718083); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718083</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718081&amp;site=ehost-live</link>
      <author>Filmus, Yuval; Hanneke, Steve; Mehalel, Idan; Moran, Shay</author>
      <category>Machine learning</category>
      <category>Prediction algorithms</category>
      <category>Stochastic learning models</category>
      <category>Advice</category>
      <title>Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718081); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718081</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718073&amp;site=ehost-live</link>
      <author>Andrews, Robert</author>
      <category>Matrix multiplications</category>
      <category>Circuit complexity</category>
      <category>Mathematical bounds</category>
      <category>Polynomials</category>
      <category>Low-rank matrices</category>
      <category>Symbolic computation</category>
      <category>Algorithms</category>
      <title>On Matrix Multiplication and Polynomial Identity Testing.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718073); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718073</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718074&amp;site=ehost-live</link>
      <author>Assadi, Sepehr; Kol, Gillat; Zhang, Zhijun</author>
      <category>Independent sets</category>
      <category>Communication models</category>
      <category>Distributed computing</category>
      <category>Distributed algorithms</category>
      <category>Bipartite graphs</category>
      <category>Mathematical bounds</category>
      <category>Communication complexity (Information theory)</category>
      <title>Rounds vs. Communication Tradeoffs for Maximal Independent Sets.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718074); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718074</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718072&amp;site=ehost-live</link>
      <author>Bender, Michael A.; Conway, Alex; Farach-Colton, Martín; Komlós, Hanna; Kuszmaul, William; Wein, Nicole</author>
      <category>Algorithms</category>
      <category>Data structures</category>
      <title>Online List Labeling: Breaking the \({\log^2 n}\) Barrier.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718072); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718072</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718071&amp;site=ehost-live</link>
      <author>Anari, Nima; Liu, Yang P.; Vuong, Thuy-Duong</author>
      <category>Spanning trees</category>
      <category>Rayleigh model</category>
      <category>Graph theory</category>
      <category>Dependence (Statistics)</category>
      <category>Sampling methods</category>
      <title>Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718071); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718071</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718076&amp;site=ehost-live</link>
      <author>Jeronimo, Fernando Granha; Mittal, Tushant; Roy, Sourya; Wigderson, Avi</author>
      <category>Ramanujan, Srinivasa, 1887-1920</category>
      <category>Cayley graphs</category>
      <category>Graph theory</category>
      <title>Almost-Ramanujan Expanders From Arbitrary Expanders via Operator Amplification.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718076); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718076</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718078&amp;site=ehost-live</link>
      <author>Kumar, Nikhil</author>
      <category>Planar graphs</category>
      <category>Metric spaces</category>
      <title>An Approximate Generalization of the Okamura–Seymour Theorem.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718078); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718078</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718079&amp;site=ehost-live</link>
      <author>Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A.</author>
      <category>Interior-point methods</category>
      <category>Linear programming</category>
      <category>Singular value decomposition</category>
      <category>Polynomial time algorithms</category>
      <category>Iterative methods (Mathematics)</category>
      <category>Combinatorics</category>
      <title>Interior Point Methods Are Not Worse than Simplex.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718079); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718079</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718077&amp;site=ehost-live</link>
      <author>Bubeck, Sébastien; Coester, Christian; Rabani, Yuval</author>
      <category>Metric spaces</category>
      <category>Optimization algorithms</category>
      <category>Dynamic programming</category>
      <category>Deterministic algorithms</category>
      <title>Shortest Paths Without a Map, but with an Entropic Regularizer.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718077); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718077</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=189718075&amp;site=ehost-live</link>
      <author>Håstad, Johan; Risse, Kilian</author>
      <category>Boolean expressions</category>
      <category>Proof theory</category>
      <title>On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited.</title>
      <description>SIAM Journal on Computing; 09/01/2025&lt;br/&gt;(AN 189718075); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Sep 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_189718075</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747313&amp;site=ehost-live</link>
      <author>MONTANARI, ANDREA</author>
      <category>Spin glasses</category>
      <category>Statistical physics</category>
      <category>Random matrices</category>
      <category>Hamiltonian mechanics</category>
      <category>Mathematical optimization</category>
      <category>Algorithms</category>
      <title>OPTIMIZATION OF THE SHERRINGTON-KIRKPATRICK HAMILTONIAN.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747313); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747313</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747314&amp;site=ehost-live</link>
      <author>BOIX-ADSERAÀ, ENRIC; BRENNAN, MATTHEW; BRESLER, GUY</author>
      <category>Computational complexity</category>
      <category>Hypergraphs</category>
      <category>Sparse graphs</category>
      <category>Combinatorics</category>
      <category>Time complexity</category>
      <category>Subgraphs</category>
      <title>THE AVERAGE-CASE COMPLEXITY OF COUNTING CLIQUES IN ERDOŐS-REÉNYI HYPERGRAPHS.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747314); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747314</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747315&amp;site=ehost-live</link>
      <author>ANARI, NIMA; REZAEI, ALIREZA</author>
      <category>Nonnegative matrices</category>
      <category>Polynomial time algorithms</category>
      <category>Approximation algorithms</category>
      <category>Mathematical proofs</category>
      <category>Mathematics</category>
      <category>Mathematical inequalities</category>
      <category>Approximation error</category>
      <title>A TIGHT ANALYSIS OF BETHE APPROXIMATION FOR PERMANENT.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747315); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747315</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747316&amp;site=ehost-live</link>
      <author>ALMAN, JOSH; LIJIE CHEN</author>
      <category>Computational complexity</category>
      <category>Circuit complexity</category>
      <category>Linear operators</category>
      <category>Mathematical bounds</category>
      <category>Matrices (Mathematics)</category>
      <category>Hamming distance</category>
      <title>EFFICIENT CONSTRUCTION OF RIGID MATRICES USING AN NP ORACLE.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747316); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747316</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747317&amp;site=ehost-live</link>
      <author>HUNG LE; SOLOMON, SHAY</author>
      <category>Spanning trees</category>
      <category>Optimization algorithms</category>
      <category>Geometric shapes</category>
      <category>Computational complexity</category>
      <title>TRULY OPTIMAL EUCLIDEAN SPANNERS.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747317); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747317</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188747318&amp;site=ehost-live</link>
      <author>JINGCHENG LIU; SINCLAIR, ALISTAIR; SRIVASTAVA, PIYUSH</author>
      <category>Partition functions</category>
      <category>Ising model</category>
      <category>Approximation algorithms</category>
      <category>Potts model</category>
      <category>Spatial analysis (Statistics)</category>
      <category>Phase transitions</category>
      <title>CORRELATION DECAY AND PARTITION FUNCTION ZEROS: ALGORITHMS AND PHASE TRANSITIONS.</title>
      <description>SIAM Journal on Computing; 07/01/2025&lt;br/&gt;(AN 188747318); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Jul 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188747318</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225823&amp;site=ehost-live</link>
      <author>CIARDO, LORENZO; ŽIVNÝ, STANISLAV</author>
      <category>Semidefinite programming</category>
      <category>Homomorphisms</category>
      <category>Spectral theory</category>
      <category>Relaxation methods (Mathematics)</category>
      <category>Graph coloring</category>
      <category>Linear equations</category>
      <title>SEMIDEFINITE PROGRAMMING AND LINEAR EQUATIONS VS. HOMOMORPHISM PROBLEMS.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225823); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225823</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225822&amp;site=ehost-live</link>
      <author>DUGHMI, SHADDIN</author>
      <category>Distribution (Probability theory)</category>
      <category>Statistical correlation</category>
      <category>Online algorithms</category>
      <category>Problem solving</category>
      <category>Algorithms</category>
      <category>Mathematical optimization</category>
      <title>FROM CONTENTION RESOLUTION TO MATROID SECRETARY AND BACK.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225822); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225822</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225819&amp;site=ehost-live</link>
      <author>KAUFMAN, ALI; MINZER, DOR</author>
      <category>Polynomials</category>
      <category>Vector spaces</category>
      <category>Information theory</category>
      <category>Parameterization</category>
      <title>IMPROVED OPTIMAL TESTING RESULTS FROM GLOBAL HYPERCONTRACTIVITY.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225819); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225819</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225820&amp;site=ehost-live</link>
      <author>CHAN, TIMOTHY M.; HE, QIZHENG; SURI, SUBHASH; XUE, JIE</author>
      <category>Computational geometry</category>
      <category>Data structures</category>
      <category>Approximation algorithms</category>
      <title>DYNAMIC GEOMETRIC SET COVER, REVISITED.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225820); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225820</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225818&amp;site=ehost-live</link>
      <author>SHERSTOV, ALEXANDER A.</author>
      <category>Boolean functions</category>
      <category>Communication complexity (Information theory)</category>
      <category>Disjunction (Logic)</category>
      <category>Boolean expressions</category>
      <category>Logic circuits</category>
      <category>Discrete mathematics</category>
      <category>Computational complexity</category>
      <title>THE APPROXIMATE DEGREE OF DNF AND CNF FORMULAS.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225818); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225818</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225824&amp;site=ehost-live</link>
      <author>FENG, WEIMING; GUO, HENG; WANG, CHUNYANG; WANG, JIAHENG; YIN, YITONG</author>
      <category>Markov chain Monte Carlo</category>
      <category>Deterministic algorithms</category>
      <category>Monte Carlo method</category>
      <category>Stochastic processes</category>
      <category>Algorithms</category>
      <title>TOWARD DERANDOMIZING MARKOV CHAIN MONTE CARLO.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225824); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225824</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=188225821&amp;site=ehost-live</link>
      <category>Quantum computing</category>
      <category>Dualism</category>
      <category>Scholarly periodical corrections</category>
      <title>ERRATUM: A FULL DICHOTOMY FOR HOLANTC, INSPIRED BY QUANTUM COMPUTATION.</title>
      <description>SIAM Journal on Computing; 05/01/2025&lt;br/&gt;(AN 188225821); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 May 2025 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_188225821</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086544&amp;site=ehost-live</link>
      <author>VAZIRANI, VIJAY V.; YANNAKAKIS, MIHALIS</author>
      <category>Algebraic numbers</category>
      <category>Computational complexity</category>
      <category>Pareto optimum</category>
      <category>Incentive (Psychology)</category>
      <category>Prices</category>
      <title>COMPUTATIONAL COMPLEXITY OF THE HYLLAND--ZECKHAUSER MECHANISM FOR ONE-SIDED MATCHING MARKETS.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086544); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086544</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086541&amp;site=ehost-live</link>
      <author>AGGARWAL, DIVESH; YANLIN CHEN; KUMARS, RAJENDRA; YIXIN SHEN</author>
      <category>Time complexity</category>
      <category>Random access memory</category>
      <category>Quantum computing</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Algorithms</category>
      <title>IMPROVED CLASSICAL AND QUANTUM ALGORITHMS FOR THE SHORTEST VECTOR PROBLEM VIA BOUNDED DISTANCE DECODING.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086541); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086541</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086539&amp;site=ehost-live</link>
      <author>DINUR, IRIT; FILMUS, YUVAL; HARSHA, PRAHLADH</author>
      <category>Commercial product testing</category>
      <category>Hypergraphs</category>
      <category>Spine</category>
      <category>Generalization</category>
      <category>Motivation (Psychology)</category>
      <title>AGREEMENT TESTS ON GRAPHS AND HYPERGRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086539); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086539</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086538&amp;site=ehost-live</link>
      <author>LOKSHTANOV, DANIEL; MISRA, PRANABENDU; PILIPCZUK, MICHAL; SAURABH, SAKET; ZEHAVI, MEIRAV</author>
      <category>Flowgraphs</category>
      <category>Directed graphs</category>
      <category>Dynamic programming</category>
      <category>Computer science</category>
      <category>Algorithms</category>
      <title>AN EXPONENTIAL TIME PARAMETERIZED ALGORITHM FOR PLANAR DISJOINT PATHS.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086538); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086538</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086542&amp;site=ehost-live</link>
      <author>RASKHODNIKOVA, SOFYA; SIVAKUMAR, SATCHIT; SMITH, ADAM; SWANBERG, MARIKA</author>
      <category>Data privacy</category>
      <category>Privacy</category>
      <category>Algorithms</category>
      <title>DIFFERENTIALLY PRIVATE SAMPLING FROM DISTRIBUTIONS.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086542); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086542</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086543&amp;site=ehost-live</link>
      <author>SCHLOMBERG, NIKLAS; THIELE, HANJO; VYGEN, JENS</author>
      <category>Approximation algorithms</category>
      <category>Geometric topology</category>
      <category>Undirected graphs</category>
      <category>Algorithms</category>
      <category>Directed graphs</category>
      <category>Planar graphs</category>
      <category>Families</category>
      <title>PACKING CYCLES IN PLANAR AND BOUNDED-GENUS GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086543); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086543</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=185086540&amp;site=ehost-live</link>
      <author>KOMARGODSKI, ILAN; LIN, WEI-KAI</author>
      <category>Memory</category>
      <category>Bins</category>
      <category>Wishes</category>
      <category>Storage</category>
      <title>A LOGARITHMIC LOWER BOUND FOR OBLIVIOUS RAM (FOR ALL PARAMETERS).</title>
      <description>SIAM Journal on Computing; 03/01/2025&lt;br/&gt;(AN 185086540); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Mar 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_185086540</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=183670110&amp;site=ehost-live</link>
      <author>COHEN-ADDAD, VINCENT; CHENGLIN FAN; EUIWOONG LEE; MESMAY, ARNAUD D. E.</author>
      <category>Task analysis</category>
      <category>Hierarchical clustering (Cluster analysis)</category>
      <category>Data analysis</category>
      <category>Algorithms</category>
      <category>Logical prediction</category>
      <title>FITTING METRICS AND ULTRAMETRICS WITH MINIMUM DISAGREEMENTS.</title>
      <description>SIAM Journal on Computing; 01/01/2025&lt;br/&gt;(AN 183670110); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_183670110</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=183670111&amp;site=ehost-live</link>
      <author>TAIHEI OKI; TASUKU SOMA</author>
      <category>Combinatorial optimization</category>
      <category>Algorithms</category>
      <category>Matrices (Mathematics)</category>
      <title>ALGEBRAIC ALGORITHMS FOR FRACTIONAL LINEAR MATROID PARITY VIA NONCOMMUTATIVE RANK.</title>
      <description>SIAM Journal on Computing; 01/01/2025&lt;br/&gt;(AN 183670111); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_183670111</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=183670112&amp;site=ehost-live</link>
      <author>DELIGKAS, ARGYRIOS; FEARNLEY, JOHN; HOLLENDER, ALEXANDROS; MELISSOURGOS, THEMISTOKLIS</author>
      <category>Probability measures</category>
      <category>Independent sets</category>
      <category>Sandwiches</category>
      <category>Ham</category>
      <category>Necklaces</category>
      <title>CONSTANT INAPPROXIMABILITY FOR PPA.</title>
      <description>SIAM Journal on Computing; 01/01/2025&lt;br/&gt;(AN 183670112); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_183670112</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390669&amp;site=ehost-live</link>
      <author>ANARI, NIMA; KUIKUI LIU; OVEIS GHARAN, SHAYAN</author>
      <category>Markov chain Monte Carlo</category>
      <category>Distribution (Probability theory)</category>
      <category>Polynomial time algorithms</category>
      <category>Partition functions</category>
      <category>Random sets</category>
      <title>SPECTRAL INDEPENDENCE IN HIGH-DIMENSIONAL EXPANDERS AND APPLICATIONS TO THE HARDCORE MODEL.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390669); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390669</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390670&amp;site=ehost-live</link>
      <author>Filmus, Yuval; Grigorescu, Elena; Sungjin Im; Yi Li</author>
      <category>Graph algorithms</category>
      <category>Legislative committees</category>
      <category>Computer science</category>
      <category>Quantum computing</category>
      <category>Applied mathematics</category>
      <title>SPECIAL SECTION ON THE SIXTY-FIRST ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2020).</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390670); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390670</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390671&amp;site=ehost-live</link>
      <author>MOSHEIFF, JONATHAN; RESCH, NICOLAS; RON-ZEWI, NOGA; SILAS, SHASHWAT; WOOTTERS, MARY</author>
      <category>Linear codes</category>
      <category>Probability theory</category>
      <title>LOW-DENSITY PARITY-CHECK CODES ACHIEVE LIST-DECODING CAPACITY.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390671); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390671</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390672&amp;site=ehost-live</link>
      <author>GOLOVNEV, ALEXANDER; POSOBIN, GLEB; REGEV, ODED; WEINSTEIN, OMRI</author>
      <category>Diophantine approximation</category>
      <category>Data structures</category>
      <category>Computational geometry</category>
      <category>Compressed sensing</category>
      <category>Data warehousing</category>
      <title>POLYNOMIAL DATA STRUCTURE LOWER BOUNDS IN THE GROUP MODEL.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390672); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390672</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390673&amp;site=ehost-live</link>
      <author>ERICKSON, JEFF; VAN DER HOOG, IVOR; MILTZOW, TILLMANN</author>
      <category>Polynomial time algorithms</category>
      <category>Random access memory</category>
      <category>Computational geometry</category>
      <category>Natural resources</category>
      <category>Commercial art galleries</category>
      <title>SMOOTHING THE GAP BETWEEN NP AND ER.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390673); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390673</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390674&amp;site=ehost-live</link>
      <author>ROTH, MARC; SCHMITT, JOHANNES; WELLNITZ, PHILIP</author>
      <category>Linguistic complexity</category>
      <category>Homomorphisms</category>
      <category>Mathematics</category>
      <category>Integers</category>
      <category>Logical prediction</category>
      <title>COUNTING SMALL INDUCED SUBGRAPHS SATISFYING MONOTONE PROPERTIES.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390674); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390674</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390675&amp;site=ehost-live</link>
      <author>KATHURIA, TARUN; LIU, YANG P.; SIDFORD, AARON</author>
      <category>Interior-point methods</category>
      <category>Algorithms</category>
      <category>Integers</category>
      <title>UNIT CAPACITY MAXFLOW IN ALMOST m 4/3 TIME.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390675); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390675</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390676&amp;site=ehost-live</link>
      <author>LOKSHTANOV, DANIEL; SAURABH, SAKET; SURIANARAYANAN, VAISHALI</author>
      <category>Polynomial time algorithms</category>
      <category>NP-complete problems</category>
      <category>Graph algorithms</category>
      <category>Computer science</category>
      <category>Graph connectivity</category>
      <category>Approximation algorithms</category>
      <title>A PARAMETERIZED APPROXIMATION SCHEME FOR MIN k-CUT.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390676); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390676</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390677&amp;site=ehost-live</link>
      <author>DÜTTING, PAUL; KESSELHEIM, THOMAS; LUCIER, BRENDAN</author>
      <category>Polynomial time algorithms</category>
      <category>Incentive (Psychology)</category>
      <category>Prices</category>
      <category>Auctions</category>
      <category>Valuation</category>
      <title>AN O (log log m) PROPHET INEQUALITY FOR SUBADDITIVE COMBINATORIAL AUCTIONS.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390677); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390677</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390678&amp;site=ehost-live</link>
      <author>EVRA, SHAI; KAUFMAN, TALI; ZÉMOR, GILLES</author>
      <category>Quantum error correcting codes</category>
      <category>Low density parity check codes</category>
      <category>Square root</category>
      <title>DECODABLE QUANTUM LDPC CODES BEYOND THE √n DISTANCE BARRIER USING HIGH-DIMENSIONAL EXPANDERS.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390678); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390678</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390679&amp;site=ehost-live</link>
      <author>ILANGO, RAHUL</author>
      <category>Circuit complexity</category>
      <category>Boolean functions</category>
      <category>Cryptography</category>
      <category>Hypothesis</category>
      <category>Motivation (Psychology)</category>
      <title>CONSTANT DEPTH FORMULA AND PARTIAL FUNCTION VERSIONS OF MCSP ARE HARD.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390679); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390679</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390680&amp;site=ehost-live</link>
      <author>BEN-DAVID, SHALEV; CHILDS, ANDREW M.; GILYÉN, ANDRÁS; KRETSCHMER, WILLIAM; PODDER, SUPARTHA; DAOCHEN WANG</author>
      <category>Computer science conferences</category>
      <category>Symmetric functions</category>
      <category>Open-ended questions</category>
      <category>Symmetry</category>
      <category>Polynomials</category>
      <title>SYMMETRIES, GRAPH PROPERTIES, AND QUANTUM SPEEDUPS.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390680); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390680</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390681&amp;site=ehost-live</link>
      <author>EHSANI, SOHEIL; HAJIAGHAYI, MOHAMMADTAGHI; KESSELHEIM, THOMAS; SINGLA, SAHIL</author>
      <category>Random variables</category>
      <category>Prices</category>
      <category>Auctions</category>
      <category>Prophets</category>
      <category>Generalization</category>
      <title>PROPHET SECRETARY FOR COMBINATORIAL AUCTIONS AND MATROIDS.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390681); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390681</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390682&amp;site=ehost-live</link>
      <author>DIEKERT, VOLKER; POTAPOV, IGOR; SEMUKHIN, PAVEL</author>
      <category>Boolean algebra</category>
      <category>Finite state machines</category>
      <category>Robots</category>
      <category>Rats</category>
      <category>Possibility</category>
      <title>DECIDABILITY OF MEMBERSHIP PROBLEMS FOR FLAT RATIONAL SUBSETS OF GL(2,Q) AND SINGULAR MATRICES.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390682); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390682</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=182390683&amp;site=ehost-live</link>
      <author>MOTTET, ANTOINE; NAGY, TOMÁŠ; PINSKER, MICHAEL; WRONA, MICHAŁ</author>
      <category>Constraint satisfaction</category>
      <category>Symmetry</category>
      <title>COLLAPSING THE BOUNDED WIDTH HIERARCHY FOR INFINITE-DOMAIN CONSTRAINT SATISFACTION PROBLEMS: WHEN SYMMETRIES ARE ENOUGH.</title>
      <description>SIAM Journal on Computing; 11/01/2024&lt;br/&gt;(AN 182390683); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Nov 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_182390683</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915426&amp;site=ehost-live</link>
      <author>ZHIYI HUANG; QIANKUN ZHANG</author>
      <category>Online algorithms</category>
      <category>Probability theory</category>
      <category>Algorithms</category>
      <category>Success</category>
      <title>ONLINE PRIMAL DUAL MEETS ONLINE MATCHING WITH STOCHASTIC REWARDS: CONFIGURATION LP TO THE RESCUE.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915426); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915426</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915432&amp;site=ehost-live</link>
      <author>MERINO, ARTURO; MÜTZE, TORSTEN</author>
      <category>Optimization algorithms</category>
      <category>Gray codes</category>
      <category>Combinatorial optimization</category>
      <category>Spanning trees</category>
      <category>Bipartite graphs</category>
      <title>TRAVERSING COMBINATORIAL 0/1-POLYTOPES VIA OPTIMIZATION.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915432); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915432</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915427&amp;site=ehost-live</link>
      <author>BODIRSKY, MANUEL; JONSSON, PETER; MARTIN, BARNABY; MOTTETH, ANTOINE; SEMANIŠINOVÁ, ŽANETA</author>
      <category>Universal algebra</category>
      <category>Constraint satisfaction</category>
      <category>Polymorphism (Zoology)</category>
      <category>Artificial intelligence</category>
      <category>Computational complexity</category>
      <title>COMPLEXITY CLASSIFICATION TRANSFER FOR CSPs VIA ALGEBRAIC PRODUCTS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915427); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915427</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915431&amp;site=ehost-live</link>
      <author>TARJAN, ROBERT E.; ZWICK, URI</author>
      <category>Data structures</category>
      <category>Double standard</category>
      <category>Integers</category>
      <title>OPTIMAL RESIZABLE ARRAYS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915431); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915431</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915424&amp;site=ehost-live</link>
      <author>ASHAROV, GILAD; BEIMEL, AMOS; MAKRIYANNIS, NIKOLAOS; OMRI, ERAN</author>
      <category>Boolean functions</category>
      <category>Matrix functions</category>
      <category>Cryptocurrencies</category>
      <category>Fairness</category>
      <category>Cryptography</category>
      <title>COMPLETE CHARACTERIZATION OF FAIRNESS IN SECURE TWO-PARTY COMPUTATION OF BOOLEAN FUNCTIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915424); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915424</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915428&amp;site=ehost-live</link>
      <author>BRESSAN, MARCO; GOLDBERG, LESLIE ANN; MEEKS, KITTY; ROTH, MARC</author>
      <category>Dense graphs</category>
      <category>Computable functions</category>
      <category>Independent sets</category>
      <category>Exponential dichotomy</category>
      <category>Complexity (Philosophy)</category>
      <category>Bipartite graphs</category>
      <title>COUNTING SUBGRAPHS IN SOMEWHERE DENSE GRAPHS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915428); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915428</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915430&amp;site=ehost-live</link>
      <author>BENNETT, HUCK; CHERAGHCHI, MAHDI; GURUSWAMI, VENKATESAN; RIBEIRO, JOAO</author>
      <category>Binary codes</category>
      <category>Vector fields</category>
      <category>Finite fields</category>
      <category>Arbitrary constants</category>
      <category>Hardness</category>
      <title>PARAMETERIZED INAPPROXIMABILITY OF THE MINIMUM DISTANCE PROBLEM OVER ALL FIELDS AND THE SHORTEST VECTOR PROBLEM IN ALL ℓp NORMS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915430); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915430</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915423&amp;site=ehost-live</link>
      <author>CHRISTODOULOU, GIORGOS; SGOURITSA, ALKMINI</author>
      <category>Euclidean metric</category>
      <category>Wrenches</category>
      <category>Heuristic</category>
      <category>Logical prediction</category>
      <category>Generalization</category>
      <title>AN IMPROVED UPPER BOUND FOR THE UNIVERSAL TSP ON THE GRID.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915423); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915423</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915429&amp;site=ehost-live</link>
      <author>KOCIUMAKA, TOMASZ; RADOSZEWSKI, JAKUB; RYTTER, WOJCIECH; WALEŃ, TOMASZ</author>
      <category>Data structures</category>
      <category>Pattern matching</category>
      <category>Deterministic algorithms</category>
      <category>Conference papers</category>
      <category>Integers</category>
      <category>Algorithms</category>
      <title>INTERNAL PATTERN MATCHING QUERIES IN A TEXT AND APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915429); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915429</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915433&amp;site=ehost-live</link>
      <author>BONNET, ÉDOUARD; DURON, JULIEN; SYLVESTER, JOHN; ZAMARAEV, VIKTOR; ZHUKOVSKII, MAKSIM</author>
      <category>Graph labelings</category>
      <category>Natural numbers</category>
      <category>Subgraphs</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Mathematics</category>
      <category>Random graphs</category>
      <title>SMALL BUT UNWIELDY: A LOWER BOUND ON ADJACENCY LABELS FOR SMALL CLASSES.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915433); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915433</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=180915425&amp;site=ehost-live</link>
      <author>BONNET, ÉDOUARD; GENIET, COLIN; EUN JUNG KIM; THOMASSÉ, STÉPHAN; WATRIGANT, RÉMI</author>
      <category>Dominating set</category>
      <category>Independent sets</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Graph coloring</category>
      <category>Dynamic programming</category>
      <category>Approximation algorithms</category>
      <category>Polynomial time algorithms</category>
      <title>TWIN-WIDTH III: MAX INDEPENDENT SET, MIN DOMINATING SET, AND COLORING.</title>
      <description>SIAM Journal on Computing; 09/01/2024&lt;br/&gt;(AN 180915425); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Sep 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_180915425</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448547&amp;site=ehost-live</link>
      <author>BUBECK, SÉBASTIEN; MIKULINCER, DAN</author>
      <category>Deterministic algorithms</category>
      <category>Smoothness of functions</category>
      <category>Algorithms</category>
      <category>Polynomials</category>
      <title>HOW TO TRAP A GRADIENT FLOW.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448547); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448547</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448548&amp;site=ehost-live</link>
      <author>ADLER, ISOLDE; KÖHLER, NOLEEN; PAN PENG</author>
      <category>First-order logic</category>
      <category>Dense graphs</category>
      <category>Suffixes &amp; prefixes (Grammar)</category>
      <category>Neighborhoods</category>
      <category>Algorithms</category>
      <title>ON TESTABILITY OF FIRST-ORDER PROPERTIES IN BOUNDED-DEGREE GRAPHS AND CONNECTIONS TO PROXIMITY-OBLIVIOUS TESTING.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448548); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448548</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448549&amp;site=ehost-live</link>
      <author>BENEDIKT, MICHAEL; KOSTYLEV, EGOR V.; TAN, TONY</author>
      <category>Arithmetic</category>
      <category>Logic</category>
      <category>Integers</category>
      <category>Counting</category>
      <title>TWO VARIABLE LOGIC WITH ULTIMATELY PERIODIC COUNTING.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448549); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448549</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448550&amp;site=ehost-live</link>
      <author>ALTSCHULER, JASON M.; BOK, JINHO; TALWAR, KUNAL</author>
      <category>Convex sets</category>
      <category>Machine learning</category>
      <category>Privacy</category>
      <category>Algorithms</category>
      <category>Noise</category>
      <title>ON THE PRIVACY OF NOISY STOCHASTIC GRADIENT DESCENT FOR CONVEX OPTIMIZATION.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448550); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448550</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448551&amp;site=ehost-live</link>
      <author>ARYA, SUNIL; DA FONSECA, GUILHERME D.; MOUNT, DAVID M.</author>
      <category>Point set theory</category>
      <category>Unit ball (Mathematics)</category>
      <category>Integer programming</category>
      <category>Geometry</category>
      <category>Convex bodies</category>
      <category>Polynomials</category>
      <category>Approximation algorithms</category>
      <title>ECONOMICAL CONVEX COVERINGS AND APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448551); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448551</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448552&amp;site=ehost-live</link>
      <author>ELLEN, FAITH; GELASHVILI, RATI; LEQI ZHU</author>
      <category>Problem solving</category>
      <category>Synchronization</category>
      <title>REVISIONIST SIMULATIONS: A NEW APPROACH TO PROVING SPACE LOWER BOUNDS.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448552); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448552</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448553&amp;site=ehost-live</link>
      <author>FOMIN, FEDOR V.; KORHONEN, TUUKKA</author>
      <category>Graph algorithms</category>
      <category>Time complexity</category>
      <category>Dynamic programming</category>
      <category>Algorithms</category>
      <category>Integers</category>
      <category>Approximation algorithms</category>
      <title>FAST FPT-APPROXIMATION OF BRANCHWIDTH.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448553); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448553</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448554&amp;site=ehost-live</link>
      <author>HAITAO WANG</author>
      <category>Data structures</category>
      <category>Algorithms</category>
      <title>ALGORITHMS FOR SUBPATH CONVEX HULL QUERIES AND RAY-SHOOTING AMONG SEGMENTS.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448554); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448554</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448555&amp;site=ehost-live</link>
      <author>LI, JASON; PANIGRAHI, DEBMALYA</author>
      <category>Sparse graphs</category>
      <category>Graph algorithms</category>
      <category>Data structures</category>
      <category>Tree graphs</category>
      <category>Undirected graphs</category>
      <title>APPROXIMATE GOMORY--HU TREE IS FASTER THAN n--1 APPROXIMATE FLOWS.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448555); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448555</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=179448556&amp;site=ehost-live</link>
      <author>ZIYUN HUANG; QILONG FENG; JIANXIN WANG; JINHUI XU</author>
      <category>Approximation algorithms</category>
      <category>Computational geometry</category>
      <category>Dynamic programming</category>
      <category>Sensor networks</category>
      <category>Point set theory</category>
      <title>PTAS FOR MINIMUM COST MULTICOVERING WITH DISKS.</title>
      <description>SIAM Journal on Computing; 07/01/2024&lt;br/&gt;(AN 179448556); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jul 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_179448556</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376525&amp;site=ehost-live</link>
      <author>GÖÖS, MIKA; HOLLENDER, ALEXANDROS; JAIN, SIDDHARTHA; MAYSTRE, GILBERT; PIRES, WILLIAM; ROBERE, ROBERT; RAN TAO</author>
      <title>FURTHER COLLAPSES IN TFNP.</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376525); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376525</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376526&amp;site=ehost-live</link>
      <author>KRISHNASWAMY, RAVISHANKAR; NAGARAJAN, VISWANATH; PRUHS, KIRK; STEIN, CLIFFORD</author>
      <category>Approximation algorithms</category>
      <category>Network routers</category>
      <category>Undirected graphs</category>
      <category>Statistical sampling</category>
      <title>CLUSTER BEFORE YOU HALLUCINATE: NODE-CAPACITATED NETWORK DESIGN AND ENERGY EFFICIENT ROUTING.</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376526); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376526</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376527&amp;site=ehost-live</link>
      <author>ABRISHAMI, TARA; CHUDNOVSKY, MARIA; PILIPCZUK, MARCIN; RZĄŻEWSKI, PAWEŁ; SEYMOUR, PAUL</author>
      <category>Thailand</category>
      <category>Independent sets</category>
      <category>Dynamic programming</category>
      <category>Containers</category>
      <category>Subgraphs</category>
      <title>INDUCED SUBGRAPHS OF BOUNDED TREEWIDTH AND THE CONTAINER METHOD.</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376527); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376527</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376528&amp;site=ehost-live</link>
      <author>ALEKSEEV, YAROSLAV; GRIGORIEV, DIMA; HIRSCH, EDWARD A.; TZAMERET, IDDO</author>
      <category>Value capture</category>
      <category>Linear equations</category>
      <category>Natural numbers</category>
      <category>Sum of squares</category>
      <category>Circuit complexity</category>
      <category>Boolean functions</category>
      <title>SEMIALGEBRAIC PROOFS, IPS LOWER BOUNDS, AND THE τ-CONJECTURE: CAN A NATURAL NUMBER BE NEGATIVE?</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376528); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376528</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376529&amp;site=ehost-live</link>
      <author>ZHIYI HUANG; QIANKUN ZHANG; YUHAO ZHANG</author>
      <category>Greedy algorithms</category>
      <category>Panoramas</category>
      <category>Internet advertising</category>
      <category>Bids</category>
      <category>Open-ended questions</category>
      <title>ADWORDS IN A PANORAMA.</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376529); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376529</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=178376530&amp;site=ehost-live</link>
      <author>DANTCHEV, STEFAN; GALESI, NICOLA; GHANI, ABDUL; MARTIN, BARNABY</author>
      <category>Encoding</category>
      <category>Exponential functions</category>
      <category>Bin packing problem</category>
      <category>Sum of squares</category>
      <category>Quadratic forms</category>
      <title>PROOF COMPLEXITY AND THE BINARY ENCODING OF COMBINATORIAL PRINCIPLES.</title>
      <description>SIAM Journal on Computing; 05/01/2024&lt;br/&gt;(AN 178376530); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 May 2024 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_178376530</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312952&amp;site=ehost-live</link>
      <author>FOCKE, JACOB; ROTH, MARC</author>
      <category>Polynomial time algorithms</category>
      <category>Computational complexity</category>
      <category>Homomorphisms</category>
      <category>Subgraphs</category>
      <title>COUNTING SMALL INDUCED SUBGRAPHS WITH HEREDITARY PROPERTIES.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312952); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312952</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312946&amp;site=ehost-live</link>
      <author>ABBOUD, AMIR; BODWIN, GREG</author>
      <category>Philadelphia (Pa.)</category>
      <category>Thailand</category>
      <category>Approximation algorithms</category>
      <category>Steiner systems</category>
      <category>Directed graphs</category>
      <category>Graph algorithms</category>
      <category>Graph theory</category>
      <category>Work design</category>
      <category>Osmosis</category>
      <title>REACHABILITY PRESERVERS: NEW EXTREMAL BOUNDS AND APPROXIMATION ALGORITHMS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312946); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312946</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312948&amp;site=ehost-live</link>
      <author>BECKER, RUBEN; EMEK, YUVAL; GHAFFARI, MOHSEN; LENZEN, CHRISTOPH</author>
      <category>Weighted graphs</category>
      <category>Undirected graphs</category>
      <category>Spanning trees</category>
      <category>Graph algorithms</category>
      <category>Diameter</category>
      <category>Computational complexity</category>
      <category>Baby strollers</category>
      <title>DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312948); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312948</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312955&amp;site=ehost-live</link>
      <author>HAVIV, ISHAY</author>
      <category>Polynomial time algorithms</category>
      <category>Algorithms</category>
      <category>Integers</category>
      <title>FIXED-PARAMETER ALGORITHMS FOR THE KNESER AND SCHRIJVER PROBLEMS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312955); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312955</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312953&amp;site=ehost-live</link>
      <author>DIRKSEN, SJOERD; MENDELSON, SHAHAR; STOLLENWERK, ALEXANDER</author>
      <category>Circulant matrices</category>
      <category>Cubes</category>
      <title>FAST METRIC EMBEDDING INTO THE HAMMING CUBE.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312953); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312953</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312951&amp;site=ehost-live</link>
      <author>CASTEIGTS, ARNAUD; RASKIN, MICHAEL; RENKEN, MALTE; ZAMARAEV, VIKTOR</author>
      <category>Spanning trees</category>
      <category>Random graphs</category>
      <category>Graph connectivity</category>
      <category>Weighted graphs</category>
      <category>Wrenches</category>
      <category>Subgraphs</category>
      <title>SHARP THRESHOLDS IN RANDOM SIMPLE TEMPORAL GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312951); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312951</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312947&amp;site=ehost-live</link>
      <author>ZEYU GUO; RAY LI; CHONG SHANGGUAN; ITZHAK TAMO; WOOTTERS, MARY</author>
      <category>Finite fields</category>
      <category>Graph theory</category>
      <category>Reed-Solomon codes</category>
      <category>Hypergraphs</category>
      <category>Logical prediction</category>
      <title>IMPROVED LIST-DECODABILITY AND LIST-RECOVERABILITY OF REED--SOLOMON CODES VIA TREE PACKINGS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312947); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312947</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312950&amp;site=ehost-live</link>
      <author>LEGRAND-DUCHESNE, CLÉMENT; RAI, ASHUTOSH; TANCER, MARTIN</author>
      <category>Axioms</category>
      <category>Decision making</category>
      <title>PARAMETERIZED COMPLEXITY OF UNTANGLING KNOTS.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312950); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312950</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312949&amp;site=ehost-live</link>
      <author>BHANGALE, AMEY; HARSHA, PRAHLADH; PARADISE, ORR; TAL, AVISHAY</author>
      <category>Sudan</category>
      <category>Hamming distance</category>
      <category>Matrices (Mathematics)</category>
      <title>RIGID MATRICES FROM RECTANGULAR PCPs.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312949); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312949</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=177312954&amp;site=ehost-live</link>
      <author>CZUMAJ, ARTUR; SOHLER, CHRISTIAN</author>
      <category>Metric spaces</category>
      <category>Directed graphs</category>
      <category>K-nearest neighbor classification</category>
      <category>Spanning trees</category>
      <category>Cost estimates</category>
      <category>Cost</category>
      <title>SUBLINEAR TIME APPROXIMATION OF THE COST OF A METRIC k -NEAREST NEIGHBOR GRAPH.</title>
      <description>SIAM Journal on Computing; 03/01/2024&lt;br/&gt;(AN 177312954); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Mar 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_177312954</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=176201224&amp;site=ehost-live</link>
      <author>GAMARNIK, DAVID; JAGANNATH, AUKOSH; WEIN, ALEXANDER S.</author>
      <category>Logic circuits</category>
      <category>Graph theory</category>
      <category>Circuit complexity</category>
      <category>Stochastic differential equations</category>
      <category>Sparse graphs</category>
      <category>Random graphs</category>
      <category>Hamiltonian graph theory</category>
      <title>HARDNESS OF RANDOM OPTIMIZATION PROBLEMS FOR BOOLEAN CIRCUITS, LOW-DEGREE POLYNOMIALS, AND LANGEVIN DYNAMICS.</title>
      <description>SIAM Journal on Computing; 01/01/2024&lt;br/&gt;(AN 176201224); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jan 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_176201224</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=176201223&amp;site=ehost-live</link>
      <author>CHUDNOVSKY, MARIA; PILIPCZUK, MARCIN; PILIPCZUK, MICHA\L; THOMASS, STEPHAN</author>
      <category>Independent sets</category>
      <category>Polynomial time algorithms</category>
      <category>Graph algorithms</category>
      <category>Claws</category>
      <title>QUASI-POLYNOMIAL TIME APPROXIMATION SCHEMES FOR THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM IN H-FREE GRAPHS.</title>
      <description>SIAM Journal on Computing; 01/01/2024&lt;br/&gt;(AN 176201223); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jan 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_176201223</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=176201225&amp;site=ehost-live</link>
      <author>KULKARNI, JANARDHAN; LIU, YANG P.; SAH, ASHWIN; SAWHNEY, MEHTAAB S.; TARNAWSKI, JAKUB</author>
      <category>Graph coloring</category>
      <category>Dead trees</category>
      <category>Online algorithms</category>
      <title>ONLINE EDGE COLORING VIA TREE RECURRENCES AND CORRELATION DECAY.</title>
      <description>SIAM Journal on Computing; 01/01/2024&lt;br/&gt;(AN 176201225); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jan 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_176201225</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=176201221&amp;site=ehost-live</link>
      <author>CHUDNOVSKY, MARIA; SPIRKL, SOPHIE; ZHONG, MINGXIAN</author>
      <category>Graph connectivity</category>
      <category>Polynomial time algorithms</category>
      <category>Algorithms</category>
      <title>FOUR-COLORING \bfitP \bfsix -FREE GRAPHS. I. EXTENDING AN EXCELLENT PRECOLORING.</title>
      <description>SIAM Journal on Computing; 01/01/2024&lt;br/&gt;(AN 176201221); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jan 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_176201221</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=176201222&amp;site=ehost-live</link>
      <author>CHUDNOVSKY, MARIA; SPIRKL, SOPHIE; ZHONG, MINGXIAN</author>
      <category>Graph connectivity</category>
      <category>Polynomial time algorithms</category>
      <category>Algorithms</category>
      <category>Logical prediction</category>
      <category>Polynomials</category>
      <title>FOUR-COLORING P6-FREE GRAPHS. II. FINDING AN EXCELLENT PRECOLORING.</title>
      <description>SIAM Journal on Computing; 01/01/2024&lt;br/&gt;(AN 176201222); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Jan 2024 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_176201222</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713355&amp;site=ehost-live</link>
      <author>ALMAN, JOSH; WILLIAMS, VIRGINIA VASSILEVSKA</author>
      <category>Matrix multiplications</category>
      <category>Group algebras</category>
      <category>Tensor algebra</category>
      <category>Design techniques</category>
      <category>Exponents</category>
      <title>LIMITS ON ALL KNOWN (AND SOME UNKNOWN) APPROACHES TO MATRIX MULTIPLICATION.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713355); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713355</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713358&amp;site=ehost-live</link>
      <author>BATRA, JATIN; GARG, NAVEEN; KUMAR, AMIT</author>
      <category>Dynamic programming</category>
      <category>Approximation algorithms</category>
      <category>Computer scheduling</category>
      <category>Job qualifications</category>
      <category>Algorithms</category>
      <category>Machinery</category>
      <title>CONSTANT FACTOR APPROXIMATION ALGORITHM FOR WEIGHTED FLOW-TIME ON A SINGLE MACHINE IN PSEUDOPOLYNOMIAL TIME.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713358); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713358</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713365&amp;site=ehost-live</link>
      <author>Boyle, Elette; Cohen-Addad, Vincent; Kolla, Alexandra; Thorup, Mikkel</author>
      <category>Computer science</category>
      <category>Conferences &amp; conventions</category>
      <category>Graph algorithms</category>
      <category>Legislative committees</category>
      <category>Matrix multiplications</category>
      <title>SPECIAL SECTION ON THE FIFTY-NINTH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2018).</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713365); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713365</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713361&amp;site=ehost-live</link>
      <author>CHU, TIMOTHY; YU GAO; PENG, RICHARD; SACHDEVA, SUSHANT; SAWLANI, SAURABH; JUNXING WANG</author>
      <category>Eulerian graphs</category>
      <category>Sparse approximations</category>
      <category>Sparse graphs</category>
      <category>Graph algorithms</category>
      <category>Directed graphs</category>
      <category>Linear systems</category>
      <title>GRAPH SPARSIFICATION, SPECTRAL SKETCHES, AND FASTER RESISTANCE COMPUTATION VIA SHORT CYCLE DECOMPOSITIONS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713361); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713361</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713357&amp;site=ehost-live</link>
      <author>GÖÖS, MIKA; RUBINSTEIN, AVIAD</author>
      <category>Nash equilibrium</category>
      <category>Game theory</category>
      <title>NEAR-OPTIMAL COMMUNICATION LOWER BOUNDS FOR APPROXIMATE NASH EQUILIBRIA.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713357); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713357</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713359&amp;site=ehost-live</link>
      <author>GROHE, MARTIN; NEUEN, DANIEL; SCHWEITZER, PASCAL</author>
      <category>New York (State)</category>
      <category>Permutation groups</category>
      <title>A FASTER ISOMORPHISM TEST FOR GRAPHS OF SMALL DEGREE.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713359); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713359</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713354&amp;site=ehost-live</link>
      <author>HAAH, JEONGWAN; HASTINGS, MATTHEW B.; KOTHARI, ROBIN; GUANG HAO LOW</author>
      <category>Qubits</category>
      <category>Algorithms</category>
      <category>Commutation (Electricity)</category>
      <category>Velocity</category>
      <category>Physics</category>
      <title>QUANTUM ALGORITHM FOR SIMULATING REAL TIME EVOLUTION OF LATTICE HAMILTONIANS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713354); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713354</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713360&amp;site=ehost-live</link>
      <author>KUMAR, AKASH; SESHADHRI, C.; STOLMAN, ANDREW</author>
      <category>Random walks</category>
      <category>Minors</category>
      <category>Random graphs</category>
      <category>Mathematics</category>
      <title>RANDOM WALKS AND FORBIDDEN MINORS I: AN n1/2+o(1)-QUERY ONE-SIDED TESTER FOR MINOR CLOSED PROPERTIES ON BOUNDED DEGREE GRAPHS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713360); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713360</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713353&amp;site=ehost-live</link>
      <author>MAHADEV, URMILA</author>
      <category>Quantum computing</category>
      <category>Data encryption</category>
      <title>CLASSICAL HOMOMORPHIC ENCRYPTION FOR QUANTUM CIRCUITS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713353); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713353</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713356&amp;site=ehost-live</link>
      <author>SHUICHI HIRAHARA</author>
      <category>Kolmogorov complexity</category>
      <category>Circuit complexity</category>
      <category>Hardness</category>
      <category>Heuristic algorithms</category>
      <title>NON-BLACK-BOX WORST-CASE TO AVERAGE-CASE REDUCTIONS WITHIN NP.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713356); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713356</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713352&amp;site=ehost-live</link>
      <author>TRAUB, VERA; VYGEN, JENS</author>
      <category>Traveling salesman problem</category>
      <category>Approximation algorithms</category>
      <category>Graph algorithms</category>
      <title>BEATING THE INTEGRALITY RATIO FOR s-t-TOURS IN GRAPHS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713352); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713352</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713364&amp;site=ehost-live</link>
      <author>APPLEBAUM, BENNY; KACHLON, ELIRAN</author>
      <category>Thailand</category>
      <category>Random graphs</category>
      <category>Bipartite graphs</category>
      <category>Subgraphs</category>
      <category>Coding theory</category>
      <category>Low density parity check codes</category>
      <category>Hypergraphs</category>
      <category>Cryptography</category>
      <title>SAMPLING GRAPHS WITHOUT FORBIDDEN SUBGRAPHS AND UNBALANCED EXPANDERS WITH NEGLIGIBLE ERROR.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713364); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713364</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713363&amp;site=ehost-live</link>
      <author>NEDERLOF, JESPER; PAWLEWICZ, JAKUB; SWENNENHUIS, CÉLINE M. F.; WĘGRZYCKI, KAROL</author>
      <category>Thailand</category>
      <category>Bin packing problem</category>
      <category>Combinatorics</category>
      <category>Bins</category>
      <category>Algorithms</category>
      <title>A FASTER EXPONENTIAL TIME ALGORITHM FOR BIN PACKING WITH A CONSTANT NUMBER OF BINS VIA ADDITIVE COMBINATORICS.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713363); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713363</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=175713362&amp;site=ehost-live</link>
      <author>DALL'AGNOL, MARCEL; GUR, TOM; LACHISH, ODED</author>
      <category>Thailand</category>
      <category>Computer science conferences</category>
      <category>Algorithms</category>
      <category>Computer science</category>
      <title>A STRUCTURAL THEOREM FOR LOCAL ALGORITHMS WITH APPLICATIONS TO CODING, TESTING, AND VERIFICATION.</title>
      <description>SIAM Journal on Computing; 11/01/2023&lt;br/&gt;(AN 175713362); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Nov 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_175713362</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841862&amp;site=ehost-live</link>
      <author>DELIGKAS, ARGYRIOS; FASOULAKIS, MICHAIL; MARKAKIS, EVANGELOS</author>
      <category>Nash equilibrium</category>
      <category>Zero sum games</category>
      <category>Linear programming</category>
      <category>Games</category>
      <category>Probability theory</category>
      <title>A POLYNOMIAL-TIME ALGORITHM FOR 1/2-WELL-SUPPORTED NASH EQUILIBRIA IN BIMATRIX GAMES.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841862); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841862</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841863&amp;site=ehost-live</link>
      <author>PANAGIOTOU, KONSTANTINOS; RAMZEWS, LEON; STUFLER, BENEDIKT</author>
      <category>Sampling (Process)</category>
      <category>Class size</category>
      <category>Random graphs</category>
      <category>Sampling methods</category>
      <title>EXACT-SIZE SAMPLING OF ENRICHED TREES IN LINEAR TIME.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841863); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841863</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841864&amp;site=ehost-live</link>
      <author>BHATTACHARYA, SAYAN; HENZINGER, MONIKA; NANONGKAI, DANUPON; XIAOWEI WU</author>
      <category>Thailand</category>
      <category>Approximation algorithms</category>
      <category>Deterministic algorithms</category>
      <category>Online algorithms</category>
      <category>Data structures</category>
      <title>DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR DYNAMIC SET COVER.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841864); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841864</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841865&amp;site=ehost-live</link>
      <author>ATSERIAS, ALBERT; FIJALKOW, JOANNA</author>
      <category>Isomorphism (Mathematics)</category>
      <category>Convex sets</category>
      <category>Semidefinite programming</category>
      <category>Linear programming</category>
      <category>Logic</category>
      <category>Ellipsoids</category>
      <title>DEFINABLE ELLIPSOID METHOD, SUMS-OF-SQUARES PROOFS, AND THE GRAPH ISOMORPHISM PROBLEM.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841865); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841865</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841866&amp;site=ehost-live</link>
      <author>SATORU IWATA; YU YOKOI</author>
      <category>Berlin (Germany)</category>
      <category>Deterministic algorithms</category>
      <category>Combinatorial optimization</category>
      <category>Integer programming</category>
      <category>Multigraph</category>
      <title>FINDING MAXIMUM EDGE-DISJOINT PATHS BETWEEN MULTIPLE TERMINALS.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841866); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841866</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841867&amp;site=ehost-live</link>
      <author>COY, SAM; CZUMAJ, ARTUR</author>
      <category>Graph algorithms</category>
      <category>Deterministic algorithms</category>
      <category>Diameter</category>
      <category>Parallel algorithms</category>
      <category>Graph connectivity</category>
      <category>Arbitrary constants</category>
      <category>Undirected graphs</category>
      <category>Vector spaces</category>
      <title>DETERMINISTIC MASSIVELY PARALLEL CONNECTIVITY.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841867); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841867</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=173841868&amp;site=ehost-live</link>
      <category>Weighted graphs</category>
      <category>Computer science</category>
      <category>Copyright licenses</category>
      <title>CORRIGENDUM: METRIC EMBEDDING VIA SHORTEST PATH DECOMPOSITIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2023&lt;br/&gt;(AN 173841868); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Sep 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_173841868</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008034&amp;site=ehost-live</link>
      <author>BRODOWSKY, ULRICH A.; HOUGARDY, STEFAN; XIANGHUI ZHONG</author>
      <category>Thailand</category>
      <category>Traveling salesman problem</category>
      <category>Heuristic</category>
      <category>Cities &amp; towns</category>
      <title>THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008034); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008034</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008033&amp;site=ehost-live</link>
      <author>BASTE, JULIEN; SAU, IGNASI; THILIKOS, DIMITRIOS M.</author>
      <category>Thailand</category>
      <category>Intersection graph theory</category>
      <category>Minors</category>
      <category>Dynamic programming</category>
      <category>Algorithms</category>
      <category>Graph connectivity</category>
      <title>HITTING MINORS ON BOUNDED TREEWIDTH GRAPHS. IV. AN OPTIMAL ALGORITHM.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008033); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008033</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008032&amp;site=ehost-live</link>
      <author>ALISTARH, DAN; ASPNES, JAMES; ELLEN, FAITH; GELASHVILI, RATI; ZHU, LEQI</author>
      <category>Valence (Chemistry)</category>
      <category>Argument</category>
      <category>Topology</category>
      <title>WHY EXTENSION-BASED PROOFS FAIL.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008032); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008032</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008030&amp;site=ehost-live</link>
      <author>BUCHBINDER, NIV; FELDMAN, MORAN; GARG, MOHIT</author>
      <category>Deterministic algorithms</category>
      <category>Submodular functions</category>
      <category>Matroids</category>
      <category>Greedy algorithms</category>
      <title>DETERMINISTIC (1/2+ε)- APPROXIMATION FOR SUBMODULAR MAXIMIZATION OVER A MATROID.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008030); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008030</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008031&amp;site=ehost-live</link>
      <author>BRESSAN, MARCO; PESERICO, ENOCH; PRETTO, LUCA</author>
      <category>Directed graphs</category>
      <category>Algorithms</category>
      <category>Computational complexity</category>
      <category>Random walks</category>
      <category>Centrality</category>
      <title>SUBLINEAR ALGORITHMS FOR LOCAL GRAPH-CENTRALITY ESTIMATION.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008031); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008031</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008036&amp;site=ehost-live</link>
      <author>GHARIBIAN, SEVAG; LE GALL, FRANÇOIS</author>
      <category>Quantum chemistry</category>
      <category>Quantum computers</category>
      <category>Ground state energy</category>
      <category>Sparse matrices</category>
      <category>Low-rank matrices</category>
      <category>Logical prediction</category>
      <category>Machine learning</category>
      <category>Cognitive computing</category>
      <title>DEQUANTIZING THE QUANTUM SINGULAR VALUE TRANSFORMATION: HARDNESS AND APPLICATIONS TO QUANTUM CHEMISTRY AND THE QUANTUM PCP CONJECTURE.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008036); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008036</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=172008035&amp;site=ehost-live</link>
      <author>VARMA, NITHIN; YUICHI YOSHIDA</author>
      <category>Hamming distance</category>
      <category>Approximation algorithms</category>
      <category>Cutting stock problem</category>
      <category>Graph algorithms</category>
      <category>Algorithms</category>
      <category>Open-ended questions</category>
      <category>Random graphs</category>
      <title>AVERAGE SENSITIVITY OF GRAPH ALGORITHMS.</title>
      <description>SIAM Journal on Computing; 07/01/2023&lt;br/&gt;(AN 172008035); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jul 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_172008035</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737272&amp;site=ehost-live</link>
      <author>GOGACZ, TOMASZ; MARCINKOWSKI, JERZY; PIERIS, ANDREAS</author>
      <category>Databases</category>
      <title>UNIFORM RESTRICTED CHASE TERMINATION.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737272); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737272</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737273&amp;site=ehost-live</link>
      <author>CHONG SHANGGUAN; ITZHAK TAMO</author>
      <category>Reed-Solomon codes</category>
      <category>Graph theory</category>
      <category>Logical prediction</category>
      <title>GENERALIZED SINGLETON BOUND AND LIST-DECODING REED--SOLOMON CODES BEYOND THE JOHNSON RADIUS.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737273); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737273</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737274&amp;site=ehost-live</link>
      <author>BYRKA, JAROSŁAW; GRANDONI, FABRIZIO; AMELI, AFROUZ JABAL</author>
      <category>New York (State)</category>
      <category>Approximation algorithms</category>
      <category>NP-hard problems</category>
      <category>Conference papers</category>
      <category>Graph connectivity</category>
      <category>Steiner systems</category>
      <title>BREACHING THE 2-APPROXIMATION BARRIER FOR CONNECTIVITY AUGMENTATION: A REDUCTION TO STEINER TREE.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737274); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737274</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737275&amp;site=ehost-live</link>
      <author>DE BERG, MARK; BODLAENDER, HANS L.; KISFALUDI-BAK, SÁNDOR; KOLAY, SUDESHNA</author>
      <category>Euclidean algorithm</category>
      <category>Bound states</category>
      <category>Algorithms</category>
      <title>AN ETH-TIGHT EXACT ALGORITHM FOR EUCLIDEAN TSP.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737275); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737275</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737276&amp;site=ehost-live</link>
      <author>BHATTACHARYYA, ARNAB; GAYEN, SUTANU; PRICE, ERIC; TAN, VINCENT Y. F.; VINODCHANDRAN, N. V.</author>
      <category>Random variables</category>
      <category>Independence (Mathematics)</category>
      <title>NEAR-OPTIMAL LEARNING OF TREE-STRUCTURED DISTRIBUTIONS BY CHOW AND LIU.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737276); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737276</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=169737277&amp;site=ehost-live</link>
      <author>KOPPARTY, SWASTIK; RON-ZEWI, NOGA; SARAF, SHUBHANGI; WOOTTERS, MARY</author>
      <category>Thailand</category>
      <category>Reed-Solomon codes</category>
      <category>Coding theory</category>
      <category>Finite fields</category>
      <category>Error-correcting codes</category>
      <category>Multiplicity (Mathematics)</category>
      <category>Linear codes</category>
      <title>IMPROVED LIST DECODING OF FOLDED REED-SOLOMON AND MULTIPLICITY CODES.</title>
      <description>SIAM Journal on Computing; 05/01/2023&lt;br/&gt;(AN 169737277); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 May 2023 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_169737277</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957842&amp;site=ehost-live</link>
      <author>SHERSTOV, ALEXANDER A.; WU, PEI</author>
      <category>Boolean matrices</category>
      <category>Boolean functions</category>
      <category>Polynomials</category>
      <title>NEAR-OPTIMAL LOWER BOUNDS ON THE THRESHOLD DEGREE AND SIGN-RANK OF AC0∗.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957842); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957842</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957848&amp;site=ehost-live</link>
      <author>FARHADI, ALIREZA; HAJIAGHAYI, MOHAMMADTAGHI; LARSEN, KASPER GREEN; SHI, ELAINE</author>
      <category>Linear network coding</category>
      <category>Integers</category>
      <category>Undirected graphs</category>
      <category>Memory</category>
      <category>Channel coding</category>
      <title>LOWER BOUNDS FOR EXTERNAL MEMORY INTEGER SORTING VIA NETWORK CODING.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957848); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957848</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957844&amp;site=ehost-live</link>
      <author>BERNSTEIN, AARON; NANONGKAI, DANUPON</author>
      <category>New York (State)</category>
      <category>IEEE Computer Society</category>
      <category>Polynomial approximation</category>
      <category>Directed graphs</category>
      <category>Approximation algorithms</category>
      <category>Graph algorithms</category>
      <category>Distributed algorithms</category>
      <category>Problem solving</category>
      <title>DISTRIBUTED EXACT WEIGHTED ALL-PAIRS SHORTEST PATHS IN RANDOMIZED NEAR-LINEAR TIME.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957844); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957844</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957840&amp;site=ehost-live</link>
      <author>BERNSTEIN, AARON; GUTENBERG, MAXIMILIAN PROBST; WULFF-NILSEN, CHRISTIAN</author>
      <category>Thailand</category>
      <category>Graph algorithms</category>
      <title>DECREMENTAL STRONGLY CONNECTED COMPONENTS AND SINGLE-SOURCE REACHABILITY IN NEAR-LINEAR TIME.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957840); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957840</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957847&amp;site=ehost-live</link>
      <author>BITANSKY, NIR; KHURANA, DAKSHITA; PANETH, OMER</author>
      <category>Open-ended questions</category>
      <title>WEAK ZERO-KNOWLEDGE BEYOND THE BLACK-BOX BARRIER.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957847); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957847</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957843&amp;site=ehost-live</link>
      <author>FILOS-RATSIKAS, ARIS; GOLDBERG, PAUL W.</author>
      <category>Necklaces</category>
      <category>Ham</category>
      <category>Computational complexity</category>
      <category>Sandwiches</category>
      <title>THE COMPLEXITY OF NECKLACE SPLITTING, CONSENSUS-HALVING, AND DISCRETE HAM SANDWICH.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957843); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957843</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957849&amp;site=ehost-live</link>
      <author>MAKARYCHEV, KONSTANTIN; MAKARYCHEV, YURY; RAZENSHTEYN, ILYA</author>
      <category>New York (State)</category>
      <category>K-means clustering</category>
      <category>Euclidean distance</category>
      <title>PERFORMANCE OF JOHNSON–LINDENSTRAUSS TRANSFORM FOR k-MEANS AND k-MEDIANS CLUSTERING.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957849); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957849</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957846&amp;site=ehost-live</link>
      <author>GRANDONI, FABRIZIO; LAEKHANUKIT, BUNDIT; SHI LI</author>
      <category>Approximation algorithms</category>
      <category>Directed graphs</category>
      <category>Algorithms</category>
      <category>Linear programming</category>
      <category>Combinatorial optimization</category>
      <category>Integer programming</category>
      <category>Sawlogs</category>
      <title>O (log² k / log log k )-APPROXIMATION ALGORITHM FOR DIRECTED STEINER TREE: A TIGHT QUASI-POLYNOMIAL TIME ALGORITHM.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957846); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957846</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957845&amp;site=ehost-live</link>
      <author>KUMAR, AKASH; SESHADHRI, C.; STOLMAN, ANDREW M.</author>
      <category>Random walks</category>
      <category>Planar graphs</category>
      <category>Graph theory</category>
      <category>Spectral theory</category>
      <category>Computer science</category>
      <title>RANDOM WALKS AND FORBIDDEN MINORS II: A poly(dε-1)-QUERY TESTER FOR MINOR-CLOSED PROPERTIES OF BOUNDED-DEGREE GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957845); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957845</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957853&amp;site=ehost-live</link>
      <author>BANSAL, NIKHIL; BATRA, JATIN; FARHADI, MAJID; TETALI, PRASAD</author>
      <category>Greedy algorithms</category>
      <category>Approximation algorithms</category>
      <category>Random variables</category>
      <category>NP-hard problems</category>
      <category>Independent variables</category>
      <category>Convex programming</category>
      <category>Algorithms</category>
      <category>Hypergraphs</category>
      <title>ON MIN SUM VERTEX COVER AND GENERALIZED MIN SUM SET COVER.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957853); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957853</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957841&amp;site=ehost-live</link>
      <author>BUBECK, SEBASTIEN; LEE, YIN TAT; LI, YUANZHI; SELLKE, MARK</author>
      <category>Metric spaces</category>
      <category>Convex sets</category>
      <category>Point set theory</category>
      <category>Online algorithms</category>
      <category>Convex bodies</category>
      <title>COMPETITIVELY CHASING CONVEX BODIES.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957841); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957841</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957839&amp;site=ehost-live</link>
      <author>MOITRA, ANKUR; WEIN, ALEXANDER S.</author>
      <category>Finite groups</category>
      <category>Orbits (Astronomy)</category>
      <category>Group actions (Mathematics)</category>
      <title>SPECTRAL METHODS FROM TENSOR NETWORKS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957839); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957839</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957850&amp;site=ehost-live</link>
      <author>BOUCHARD, SEBASTIEN; DIEUDONNE, YOANN; PELC, ANDRZEJ</author>
      <category>Polynomial time algorithms</category>
      <category>Information sharing</category>
      <category>Deterministic algorithms</category>
      <category>Problem solving</category>
      <title>WANT TO GATHER? NO NEED TO CHATTER.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957850); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957850</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957851&amp;site=ehost-live</link>
      <author>FILOS-RATSIKAS, ARIS; HOLLENDER, ALEXANDROS; SOTIRAKI, KATERINA; ZAMPETAKIS, MANOLIS</author>
      <category>Distributed algorithms</category>
      <category>Valuation</category>
      <category>Open-ended questions</category>
      <title>CONSENSUS-HALVING: DOES IT EVER GET EASIER?</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957851); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957851</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957852&amp;site=ehost-live</link>
      <author>BOISSONNAT, JEAN-DANIEL; KACHANOVICH, SIARGEY; WINTRAECKEN, MATHIJS</author>
      <category>Polynomial time algorithms</category>
      <category>Dimensional reduction algorithms</category>
      <category>Triangulation</category>
      <category>Smoothness of functions</category>
      <title>TRACING ISOMANIFOLDS IN Rd IN TIME POLYNOMIAL IN d USING COXETER--FREUDENTHAL--KUHN TRIANGULATIONS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957852); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957852</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957838&amp;site=ehost-live</link>
      <author>RAGHAVAN, MANISH; SLIVKINS, ALEKSANDRS; VAUGHAN, JENNIFER WORTMAN; WU, ZHIWEI STEVEN</author>
      <category>Machine learning</category>
      <category>Online algorithms</category>
      <category>Online education</category>
      <category>Internet content</category>
      <category>Time perspective</category>
      <category>Greedy algorithms</category>
      <title>GREEDY ALGORITHM ALMOST DOMINATES IN SMOOTHED CONTEXTUAL BANDITS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957838); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957838</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957856&amp;site=ehost-live</link>
      <author>SHERSTOV, ALEXANDER A.; STOROZHENKO, ANDREY A.; WU, PEI</author>
      <category>Thailand</category>
      <category>Decision trees</category>
      <category>Absolute value</category>
      <category>Computer science</category>
      <category>Boolean functions</category>
      <category>Algorithms</category>
      <category>Fourier analysis</category>
      <title>AN OPTIMAL SEPARATION OF RANDOMIZED AND QUANTUM QUERY COMPLEXITY.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957856); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957856</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957854&amp;site=ehost-live</link>
      <author>GROCHOW, JOSHUA; QIAO, YOUMING</author>
      <category>Polynomials</category>
      <category>Polynomial time algorithms</category>
      <category>Cryptography</category>
      <category>Machine learning</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Computational group theory</category>
      <title>ON THE COMPLEXITY OF ISOMORPHISM PROBLEMS FOR TENSORS, GROUPS, AND POLYNOMIALS I: TENSOR ISOMORPHISM-COMPLETENESS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957854); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957854</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=163957855&amp;site=ehost-live</link>
      <author>DAVIES, EWAN; PERKINS, WILL</author>
      <category>Complete graphs</category>
      <category>Combinatorics</category>
      <category>Computational complexity</category>
      <category>Counting</category>
      <category>Independent sets</category>
      <title>APPROXIMATELY COUNTING INDEPENDENT SETS OF A GIVEN SIZE IN BOUNDED-DEGREE GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2023&lt;br/&gt;(AN 163957855); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Mar 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_163957855</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778813&amp;site=ehost-live</link>
      <author>CIARDO, LORENZO; ŽIVNÝ, STANISLAV</author>
      <category>Thailand</category>
      <category>Constraint satisfaction</category>
      <category>Algorithms</category>
      <category>Constraint algorithms</category>
      <category>Linear programming</category>
      <category>Symmetry</category>
      <title>CLAP: A NEW ALGORITHM FOR PROMISE CSPS.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778813); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778813</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778814&amp;site=ehost-live</link>
      <author>KROKHIN, ANDREI; OPRŠAL, JAKUB; WROCHNA, MARCIN; ŽIVNÝ, STANISLAV</author>
      <category>Constraint satisfaction</category>
      <category>Topology</category>
      <category>Homomorphisms</category>
      <category>Graph coloring</category>
      <category>NP-hard problems</category>
      <title>TOPOLOGY AND ADJUNCTION IN PROMISE CONSTRAINT SATISFACTION.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778814); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778814</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778815&amp;site=ehost-live</link>
      <author>FILOS-RATSIKAS, ARIS; GIANNAKOPOULOS, YIANNIS; HOLLENDER, ALEXANDROS; LAZOS, PHILIP; POÇAS, DIOGO</author>
      <category>Auctions</category>
      <category>Continuous distributions</category>
      <category>Bids</category>
      <category>Nash equilibrium</category>
      <category>Equilibrium</category>
      <title>ON THE COMPLEXITY OF EQUILIBRIUM COMPUTATION IN FIRST-PRICE AUCTIONS.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778815); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778815</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778816&amp;site=ehost-live</link>
      <author>BHATTIPROLU, VIJAY; GHOSH, MRINAL KANTI; GURUSWAMI, VENKATESAN; LEE, EUIWOONG; TULSIANI, MADHUR</author>
      <category>Matrix norms</category>
      <category>Approximation algorithms</category>
      <category>NP-hard problems</category>
      <category>Polynomials</category>
      <category>Algorithms</category>
      <title>Inapproximability of matrix p → q norms.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778816); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778816</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778817&amp;site=ehost-live</link>
      <author>CHAMBERS, ERIN W.; ERICKSON, JEFF; FOX, KYLE; NAYYERI, AMIR</author>
      <category>Weighted graphs</category>
      <category>Planar graphs</category>
      <category>Undirected graphs</category>
      <category>Problem solving</category>
      <category>Algorithms</category>
      <title>MINIMUM CUTS IN SURFACE GRAPHS.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778817); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778817</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778818&amp;site=ehost-live</link>
      <author>ZONGCHEN CHEN; KUIKUI LIU; VIGODA, ERIC</author>
      <category>Partition functions</category>
      <category>Ising model</category>
      <category>Combinatorics</category>
      <category>Independent sets</category>
      <category>Markov processes</category>
      <category>Spanning trees</category>
      <title>RAPID MIXING OF GLAUBER DYNAMICS UP TO UNIQUENESS VIA CONTRACTION.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778818); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778818</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=162778820&amp;site=ehost-live</link>
      <author>KUSH, DEEPANSHU; ROSSMAN, BENJAMIN</author>
      <category>Thailand</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Ramsey numbers</category>
      <category>Computer science conferences</category>
      <category>Circuit complexity</category>
      <category>Polynomial approximation</category>
      <category>Graph coloring</category>
      <title>TREE-DEPTH AND THE FORMULA COMPLEXITY OF SUBGRAPH ISOMORPHISM.</title>
      <description>SIAM Journal on Computing; 01/01/2023&lt;br/&gt;(AN 162778820); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Jan 2023 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_162778820</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682058&amp;site=ehost-live</link>
      <author>APERS, SIMON; DE WOLF, RONALD</author>
      <category>Quantum graph theory</category>
      <category>Approximation algorithms</category>
      <category>Cutting stock problem</category>
      <category>Weighted graphs</category>
      <category>Graph theory</category>
      <category>Linear systems</category>
      <category>Random graphs</category>
      <title>QUANTUM SPEEDUP FOR GRAPH SPARSIFICATION, CUT APPROXIMATION, AND LAPLACIAN SOLVING.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682058); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682058</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682059&amp;site=ehost-live</link>
      <author>AUGUSTINE, JOHN; MOSES Jr., WILLIAM K.; REDLICH, AMANDA; UPFAL, ELI</author>
      <category>Thailand</category>
      <category>Greedy algorithms</category>
      <category>Patience</category>
      <category>Cost structure</category>
      <category>Virtue</category>
      <category>Virtues</category>
      <title>BALANCED ALLOCATION: PATIENCE IS NOT A VIRTUE.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682059); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682059</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682060&amp;site=ehost-live</link>
      <author>KOMARGODSKI, ILAN; MORAN, TAL; NAOR, MONI; PASS, RAFAEL; ROSEN, ALON; YOGEV, EYLON</author>
      <category>Berlin (Germany)</category>
      <category>Cryptocurrencies</category>
      <category>Cryptography</category>
      <category>Hardness</category>
      <category>Conferences &amp; conventions</category>
      <title>ONE-WAY FUNCTIONS AND (IM)PERFECT OBFUSCATION.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682060); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682060</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682061&amp;site=ehost-live</link>
      <author>DASKALAKIS, CONSTANTINOS; FISHELSON, MAXWELL; LUCIER, BRENDAN; SYRGKANIS, VASILIS; VELUSAMY, SANTHOSHINI</author>
      <category>Thailand</category>
      <category>Auctions</category>
      <category>Geometric approach</category>
      <category>Artificial intelligence</category>
      <category>Online education</category>
      <category>Bids</category>
      <title>MULTI-ITEM NONTRUTHFUL AUCTIONS ACHIEVE GOOD REVENUE.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682061); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682061</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682062&amp;site=ehost-live</link>
      <author>CHIESA, ALESSANDRO; GUR, TOM; SHINKAR, IGOR</author>
      <category>Thailand</category>
      <category>Block codes</category>
      <category>Computer science conferences</category>
      <category>Coding theory</category>
      <title>RELAXED LOCALLY CORRECTABLE CODES WITH NEARLY-LINEAR BLOCK LENGTH AND CONSTANT QUERY COMPLEXITY.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682062); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682062</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=161682063&amp;site=ehost-live</link>
      <author>FOMIN, FEDOR V.; LOKSHTANOV, DANIEL; MARX, DÁNIEL; PILIPCZUK, MARCIN; PILIPCZUK, MICHAŁ; SAURABH, SAKET</author>
      <category>Planar graphs</category>
      <category>Graph connectivity</category>
      <category>Polynomial time algorithms</category>
      <category>Isomorphism (Mathematics)</category>
      <category>Algorithms</category>
      <category>Dynamic programming</category>
      <title>SUBEXPONENTIAL PARAMETERIZED ALGORITHMS FOR PLANAR AND APEX-MINOR-FREE GRAPHS VIA LOW TREEWIDTH PATTERN COVERING.</title>
      <description>SIAM Journal on Computing; 11/01/2022&lt;br/&gt;(AN 161682063); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Nov 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_161682063</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877447&amp;site=ehost-live</link>
      <author>LEAKE, JONATHAN; VISHNOI, NISHEETH K.</author>
      <category>Von Neumann, John, 1903-1957</category>
      <category>Maximum entropy method</category>
      <category>Quantum entropy</category>
      <category>Density matrices</category>
      <category>Haar integral</category>
      <category>Convex bodies</category>
      <category>Polynomial time algorithms</category>
      <category>Quantum computing</category>
      <title>ON THE COMPUTABILITY OF CONTINUOUS MAXIMUM ENTROPY DISTRIBUTIONS WITH APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877447); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877447</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877444&amp;site=ehost-live</link>
      <author>DUCOFFE, GUILLAUME; HABIB, MICHEL; VIENNOT, LAURENT</author>
      <category>Hypergraphs</category>
      <category>Deterministic algorithms</category>
      <category>Dense graphs</category>
      <category>Diameter</category>
      <category>Planar graphs</category>
      <category>Petri nets</category>
      <title>DIAMETER, ECCENTRICITIES AND DISTANCE ORACLE COMPUTATIONS ON H-MINOR FREE GRAPHS AND GRAPHS OF BOUNDED (DISTANCE) VAPNIK{CHERVONENKIS DIMENSION.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877444); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877444</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877448&amp;site=ehost-live</link>
      <author>YAONAN JIN; SHUNHUA JIANG; PINYAN LU; HENGJIE ZHANG</author>
      <category>Prices</category>
      <category>Auctions</category>
      <title>TIGHT REVENUE GAPS AMONG MULTIUNIT MECHANISMS.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877448); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877448</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877446&amp;site=ehost-live</link>
      <author>CONTE, ALESSIO; GROSSI, ROBERTO; MARINO, ANDREA; UNO, TAKEAKI; VERSARI, LUCA</author>
      <category>Bipartite graphs</category>
      <category>Parent-child relationships</category>
      <category>Directed graphs</category>
      <category>Subgraphs</category>
      <category>Polynomials</category>
      <title>PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877446); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877446</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877449&amp;site=ehost-live</link>
      <author>VESELY, PAVEL; CHROBAK, MAREK; JEŻ, LUKASZ; SGALL, JIŘÍ</author>
      <category>Online algorithms</category>
      <category>Golden ratio</category>
      <category>Deadlines</category>
      <category>Algorithms</category>
      <category>Switching systems (Telecommunication)</category>
      <category>Scheduling</category>
      <title>A φ-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877449); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877449</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=160877445&amp;site=ehost-live</link>
      <author>RABANI, YUVAL; SHPILKA, AMIR</author>
      <category>Thailand</category>
      <title>CORRIGENDUM: EXPLICIT CONSTRUCTION OF A SMALL EPSILON-NET FOR LINEAR THRESHOLD FUNCTIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2022&lt;br/&gt;(AN 160877445); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Sep 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_160877445</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783143&amp;site=ehost-live</link>
      <author>DELL, HOLGER; LAPINSKAS, JOHN; MEEKS, KITTY</author>
      <category>Dell Technologies Inc.</category>
      <category>Constraint satisfaction</category>
      <category>Hypergraphs</category>
      <category>Counting</category>
      <category>Witnesses</category>
      <category>Subgraphs</category>
      <title>APPROXIMATELY COUNTING AND SAMPLING SMALL WITNESSES USING A COLORFUL DECISION ORACLE.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783143); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783143</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783144&amp;site=ehost-live</link>
      <author>LAP CHI LAU; HONG ZHOU</author>
      <category>Experimental design</category>
      <category>Search algorithms</category>
      <category>Electric bicycles</category>
      <category>Backpacks</category>
      <category>Algorithms</category>
      <title>A LOCAL SEARCH FRAMEWORK FOR EXPERIMENTAL DESIGN.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783144); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783144</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783145&amp;site=ehost-live</link>
      <author>KAPLAN, HAIM; MANSOUR, YISHAY; MATIAS, YOSSI; STEMMER, URI</author>
      <category>Concept learning</category>
      <category>Greedy algorithms</category>
      <category>Machine learning</category>
      <category>Polygons</category>
      <category>Sample size (Statistics)</category>
      <title>DIFFERENTIALLY PRIVATE LEARNING OF GEOMETRIC CONCEPTS.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783145); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783145</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783146&amp;site=ehost-live</link>
      <author>GUPTA, ANUPAM; KUMAR, AMIT; PANIGRAHI, DEBMALYA</author>
      <category>Online algorithms</category>
      <category>Computer science</category>
      <category>NP-hard problems</category>
      <category>Cache memory</category>
      <category>Approximation algorithms</category>
      <category>Algorithms</category>
      <title>CACHING WITH TIME WINDOWS AND DELAYS.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783146); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783146</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783147&amp;site=ehost-live</link>
      <author>LAP CHI LAU; HONG ZHOU</author>
      <category>Discrepancy theorem</category>
      <category>Experimental design</category>
      <title>A SPECTRAL APPROACH TO NETWORK DESIGN.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783147); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783147</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783148&amp;site=ehost-live</link>
      <author>EZRA, ESTHER; SHARIR, MICHA</author>
      <category>Intersection numbers</category>
      <category>Data structures</category>
      <category>Polyhedra</category>
      <category>Triangles</category>
      <category>Counting</category>
      <title>ON RAY SHOOTING FOR TRIANGLES IN 3-SPACE AND RELATED PROBLEMS.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783148); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783148</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783149&amp;site=ehost-live</link>
      <author>LEME, RENATO PAES; SCHNEIDER, JON</author>
      <category>Time-based pricing</category>
      <category>Symmetric functions</category>
      <category>Convex sets</category>
      <category>Convex geometry</category>
      <category>Geometry</category>
      <title>CONTEXTUAL SEARCH VIA INTRINSIC VOLUMES.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783149); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783149</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783150&amp;site=ehost-live</link>
      <author>BEIMEL, AMOS; HAITNER, IFTACH; MAKRIYANNIS, NIKOLAOS; OMRI, ERAN</author>
      <category>Thailand</category>
      <category>Square root</category>
      <category>Martingales (Mathematics)</category>
      <category>Cryptography</category>
      <title>TIGHTER BOUNDS ON MULTIPARTY COIN FLIPPING VIA AUGMENTED WEAK MARTINGALES AND DIFFERENTIALLY PRIVATE SAMPLING.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783150); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783150</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783151&amp;site=ehost-live</link>
      <author>MAHADEV, URMILA</author>
      <category>Quantum computing</category>
      <category>Quantum computers</category>
      <category>Trust</category>
      <title>CLASSICAL VERIFICATION OF QUANTUM COMPUTATIONS.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783151); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783151</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783152&amp;site=ehost-live</link>
      <author>TIDOR, JONATHAN; YUFEI ZHAO</author>
      <category>Technological innovations</category>
      <category>Arithmetic</category>
      <category>Logical prediction</category>
      <category>Integers</category>
      <category>Fourier analysis</category>
      <title>TESTING LINEAR-INVARIANT PROPERTIES.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783152); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783152</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783153&amp;site=ehost-live</link>
      <author>ANAND, KONRAD; JERRUM, MARK</author>
      <category>Boltzmann factor</category>
      <category>Gibbs sampling</category>
      <title>PERFECT SAMPLING IN INFINITE SPIN SYSTEMS VIA STRONG SPATIAL MIXING.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783153); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783153</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783154&amp;site=ehost-live</link>
      <author>HERSHBERGER, JOHN; SURI, SUBHASH; YILDIZ, HAKAN</author>
      <category>Data structures</category>
      <category>Algorithms</category>
      <title>A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783154); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783154</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783155&amp;site=ehost-live</link>
      <author>HAJIAGHAYI, MOHAMMADTAGHI; SEDDIGHIN, MASOUD; SEDDIGHIN, SAEEDREZA; XIAORUI SUN</author>
      <category>Approximation algorithms</category>
      <category>Combinatorial optimization</category>
      <category>Heart beat</category>
      <category>Sampling (Process)</category>
      <title>APPROXIMATING LONGEST COMMON SUBSEQUENCE IN LINEAR TIME: BEATING THE √n BARRIER.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783155); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783155</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783156&amp;site=ehost-live</link>
      <author>MULL, NATHAN; SHUO PANG; RAZBOROV, ALEXANDER</author>
      <category>Artificial intelligence</category>
      <category>Learning strategies</category>
      <title>ON CDCL-BASED PROOF SYSTEMS WITH THE ORDERED DECISION STRATEGY.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783156); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783156</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=159783157&amp;site=ehost-live</link>
      <author>BROADBENT, ANNE; GRILO, ALEX BREDARIOL</author>
      <category>Density matrices</category>
      <category>Quantum states</category>
      <category>Polynomial time algorithms</category>
      <category>Quantum computers</category>
      <category>Qubits</category>
      <title>QMA-HARDNESS OF CONSISTENCY OF LOCAL DENSITY MATRICES WITH APPLICATIONS TO QUANTUM ZERO-KNOWLEDGE.</title>
      <description>SIAM Journal on Computing; 07/01/2022&lt;br/&gt;(AN 159783157); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jul 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_159783157</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578779&amp;site=ehost-live</link>
      <author>IDZIAK, PAWEŁ M.; KRZACZKOWSKI, JACEK</author>
      <category>Algebra</category>
      <category>Geometric congruences</category>
      <category>Problem solving</category>
      <category>Polynomial time algorithms</category>
      <title>SATISFIABILITY IN MULTIVALUED CIRCUITS.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578779); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578779</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578780&amp;site=ehost-live</link>
      <author>MERINO, ARTURO; MIČKA, ONDŘEJ; MÜTZE, TORSTEN</author>
      <category>Gray codes</category>
      <category>Logical prediction</category>
      <title>ON A COMBINATORIAL GENERATION PROBLEM OF KNUTH.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578780); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578780</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578781&amp;site=ehost-live</link>
      <author>ASHAROV, GILAD; WEI-KAI LIN; SHI, ELAINE</author>
      <category>Circuit complexity</category>
      <category>Short circuits</category>
      <category>Logic circuits</category>
      <category>Linear network coding</category>
      <category>Quantum networks (Optics)</category>
      <title>SORTING SHORT KEYS IN CIRCUITS OF SIZE o(n log n).</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578781); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578781</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578782&amp;site=ehost-live</link>
      <author>INDYK, PIOTR; WAGNER, TAL</author>
      <category>Manhattan (New York, N.Y.)</category>
      <category>Euclidean metric</category>
      <category>Mathematics</category>
      <title>OPTIMAL (EUCLIDEAN) METRIC COMPRESSION.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578782); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578782</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578783&amp;site=ehost-live</link>
      <author>XI CHEN; DIAKONIKOLAS, ILIAS; ORFANOU, ANTHI; PAPARAS, DIMITRIS; XIAORUI SUN; YANNAKAKIS, MIHALIS</author>
      <category>Lotteries</category>
      <category>Computational complexity</category>
      <category>Value (Economics)</category>
      <title>ON THE COMPLEXITY OF OPTIMAL LOTTERY PRICING AND RANDOMIZED MECHANISMS FOR A UNIT-DEMAND BUYER.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578783); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578783</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578785&amp;site=ehost-live</link>
      <author>BRAKENSIEK, JOSHUA; GOPI, SIVAKANTH; GURUSWAMI, VENKATESAN</author>
      <category>Constraint algorithms</category>
      <category>Constraint satisfaction</category>
      <category>Linear codes</category>
      <category>Coding theory</category>
      <category>Polynomial time algorithms</category>
      <category>Hamming weight</category>
      <category>Geometric congruences</category>
      <category>Modular forms</category>
      <title>CONSTRAINT SATISFACTION PROBLEMS WITH GLOBAL MODULAR CONSTRAINTS: ALGORITHMS AND HARDNESS VIA POLYNOMIAL REPRESENTATIONS.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578785); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578785</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578786&amp;site=ehost-live</link>
      <author>CHAN, TIMOTHY M.; HAR-PELED, SARIEL; JONES, MITCHELL</author>
      <category>Centroid</category>
      <category>Point set theory</category>
      <category>Geometry</category>
      <title>OPTIMAL ALGORITHMS FOR GEOMETRIC CENTERS AND DEPTH.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578786); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578786</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578787&amp;site=ehost-live</link>
      <author>CHAN, TIMOTHY F.; COOPER, JACOB W.; KOUTECKÝ, MARTIN; KRÁL, DANIEL; PEKÁRKOVÁ, KRISTÝNA</author>
      <category>Integer programming</category>
      <category>Finite fields</category>
      <category>Matrices (Mathematics)</category>
      <category>Algorithms</category>
      <category>Linear programming</category>
      <category>Matroids</category>
      <category>Magic squares</category>
      <category>Solvable groups</category>
      <title>MATRICES OF OPTIMAL TREE-DEPTH AND A ROW-INVARIANT PARAMETERIZED ALGORITHM FOR INTEGER PROGRAMMING.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578787); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578787</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578788&amp;site=ehost-live</link>
      <author>ADAMASZEK, ANNA; CZUMAJ, ARTUR; ENGLERT, MATTHIAS; RÄCKE, HARALD</author>
      <category>Online algorithms</category>
      <category>Deterministic algorithms</category>
      <title>ALMOST TIGHT BOUNDS FOR REORDERING BUFFER MANAGEMENT.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578788); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578788</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=157578789&amp;site=ehost-live</link>
      <author>CHIH-HUNG LIU</author>
      <category>Geometric approach</category>
      <category>Spanning trees</category>
      <category>Euclidean metric</category>
      <category>Data structures</category>
      <category>Intersection graph theory</category>
      <category>Euclidean distance</category>
      <title>NEARLY OPTIMAL PLANAR k NEAREST NEIGHBORS QUERIES UNDER GENERAL DISTANCE FUNCTIONS.</title>
      <description>SIAM Journal on Computing; 05/01/2022&lt;br/&gt;(AN 157578789); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 May 2022 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_157578789</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=156540336&amp;site=ehost-live</link>
      <author>GILLIBERT, PIERRE; JONUŠAS, JULIUS; KOMPATSCHER, MICHAEL; MOTTET, ANTOINE; PINSKER, MICHAEL</author>
      <category>Constraint satisfaction</category>
      <category>Computational complexity</category>
      <category>NP-hard problems</category>
      <category>Symmetry</category>
      <category>Fuzzy sets</category>
      <title>WHEN SYMMETRIES ARE NOT ENOUGH: A HIERARCHY OF HARD CONSTRAINT SATISFACTION PROBLEMS.</title>
      <description>SIAM Journal on Computing; 03/01/2022&lt;br/&gt;(AN 156540336); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Mar 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_156540336</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=156540337&amp;site=ehost-live</link>
      <author>BAVARIAN, MOHAMMAD; VIDICK, THOMAS; YUEN, HENRY</author>
      <category>Thailand</category>
      <category>Games</category>
      <category>Quantum theory</category>
      <title>ANCHORED PARALLEL REPETITION FOR NONLOCAL GAMES.</title>
      <description>SIAM Journal on Computing; 03/01/2022&lt;br/&gt;(AN 156540337); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Mar 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_156540337</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=156540338&amp;site=ehost-live</link>
      <author>MARX, DÁNIEL; PILIPCZUK, MARCIN; PILIPCZUK, MICHAL</author>
      <category>Philadelphia (Pa.)</category>
      <category>Thailand</category>
      <category>Marx, Karl, 1818-1883</category>
      <category>Traveling salesman problem</category>
      <category>Planar graphs</category>
      <category>Directed graphs</category>
      <category>Undirected graphs</category>
      <category>Square root</category>
      <category>Algorithms</category>
      <title>A SUBEXPONENTIAL PARAMETERIZED ALGORITHM FOR DIRECTED SUBSET TRAVELING SALESMAN PROBLEM ON PLANAR GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2022&lt;br/&gt;(AN 156540338); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Mar 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_156540338</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=156540339&amp;site=ehost-live</link>
      <author>ABRAHAM, ITTAI; FILTSER, ARNOLD; GUPTA, ANUPAM; NEIMAN, OFER</author>
      <category>Planar graphs</category>
      <category>Weighted graphs</category>
      <category>Exponential sums</category>
      <title>METRIC EMBEDDING VIA SHORTEST PATH DECOMPOSITIONS.</title>
      <description>SIAM Journal on Computing; 03/01/2022&lt;br/&gt;(AN 156540339); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Mar 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_156540339</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=155447943&amp;site=ehost-live</link>
      <author>NOWOTKA, DIRK; SAARELA, ALEKSI</author>
      <category>Equations</category>
      <category>Vocabulary</category>
      <title>AN OPTIMAL BOUND ON THE SOLUTION SETS OF ONE-VARIABLE WORD EQUATIONS AND ITS CONSEQUENCES.</title>
      <description>SIAM Journal on Computing; 01/01/2022&lt;br/&gt;(AN 155447943); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jan 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_155447943</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=155447944&amp;site=ehost-live</link>
      <author>CARBONNEL, CLÉMENT; ROMERO, MIGUEL; ŽIVNÝ, STANISLAV</author>
      <category>New York (State)</category>
      <category>Constraint satisfaction</category>
      <category>Constraint programming</category>
      <category>Homomorphisms</category>
      <category>Programming languages</category>
      <title>THE COMPLEXITY OF GENERAL-VALUED CONSTRAINT SATISFACTION PROBLEMS SEEN FROM THE OTHER SIDE.</title>
      <description>SIAM Journal on Computing; 01/01/2022&lt;br/&gt;(AN 155447944); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jan 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_155447944</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=155447945&amp;site=ehost-live</link>
      <author>BALLIU, ALKIDA; BRANDT, SEBASTIAN; OLIVETTI, DENNIS</author>
      <category>Thailand</category>
      <category>Deterministic algorithms</category>
      <category>Distributed computing</category>
      <category>Independent sets</category>
      <title>DISTRIBUTED LOWER BOUNDS FOR RULING SETS.</title>
      <description>SIAM Journal on Computing; 01/01/2022&lt;br/&gt;(AN 155447945); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jan 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_155447945</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=155447946&amp;site=ehost-live</link>
      <author>BÉRCZI, KRISTÓF; BOROS, ENDRE; ČEPEK, ONDŘEJ; KUČERA, PETR; KAZUHISA MAKINO</author>
      <category>Computational mathematics</category>
      <category>Relational databases</category>
      <category>Approximation algorithms</category>
      <title>APPROXIMATING MINIMUM REPRESENTATIONS OF KEY HORN FUNCTIONS.</title>
      <description>SIAM Journal on Computing; 01/01/2022&lt;br/&gt;(AN 155447946); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jan 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_155447946</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=155447947&amp;site=ehost-live</link>
      <author>TRAUB, VERA; VYGEN, JENS</author>
      <category>Approximation algorithms</category>
      <category>Traveling salesman problem</category>
      <category>Algorithms</category>
      <title>AN IMPROVED APPROXIMATION ALGORITHM FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM.</title>
      <description>SIAM Journal on Computing; 01/01/2022&lt;br/&gt;(AN 155447947); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 Jan 2022 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_155447947</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=154329734&amp;site=ehost-live</link>
      <author>BRAKENSIEK, JOSHUA; GURUSWAMI, VENKATESAN</author>
      <category>Constraint satisfaction</category>
      <category>Polynomial time algorithms</category>
      <category>Computational complexity</category>
      <category>Boolean functions</category>
      <category>Linear programming</category>
      <category>Hypergraphs</category>
      <title>PROMISE CONSTRAINT SATISFACTION: ALGEBRAIC STRUCTURE AND A SYMMETRIC BOOLEAN DICHOTOMY.</title>
      <description>SIAM Journal on Computing; 11/01/2021&lt;br/&gt;(AN 154329734); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Nov 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_154329734</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=154329735&amp;site=ehost-live</link>
      <author>GALANIS, ANDREAS; GOLDBERG, LESLIE ANN; HENG GUO; KUAN YANG</author>
      <category>Random numbers</category>
      <category>Marginal distributions</category>
      <category>Counting</category>
      <title>COUNTING SOLUTIONS TO RANDOM CNF FORMULAS.</title>
      <description>SIAM Journal on Computing; 11/01/2021&lt;br/&gt;(AN 154329735); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Nov 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_154329735</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=154329736&amp;site=ehost-live</link>
      <author>BACKENS, MIRIAM</author>
      <category>Quantum computing</category>
      <category>Quantum information theory</category>
      <category>Quantum entanglement</category>
      <category>Planar graphs</category>
      <title>A FULL DICHOTOMY FOR Holantc INSPIRED BY QUANTUM COMPUTATION.</title>
      <description>SIAM Journal on Computing; 11/01/2021&lt;br/&gt;(AN 154329736); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Nov 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_154329736</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=154329737&amp;site=ehost-live</link>
      <author>MINGLONG QIN; PENGHUI YAO</author>
      <category>Games</category>
      <category>Fourier analysis</category>
      <category>Bipartite graphs</category>
      <title>NONLOCAL GAMES WITH NOISY MAXIMALLY ENTANGLED STATES ARE DECIDABLE.</title>
      <description>SIAM Journal on Computing; 11/01/2021&lt;br/&gt;(AN 154329737); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Nov 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_154329737</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=154329738&amp;site=ehost-live</link>
      <author>MURTAGH, JACK; REINGOLD, OMER; SIDFORD, AARON; VADHAN, SALIL</author>
      <category>New York (State)</category>
      <category>Berlin (Germany)</category>
      <category>Undirected graphs</category>
      <category>Graph algorithms</category>
      <category>Deterministic algorithms</category>
      <category>Linear systems</category>
      <category>Parallel algorithms</category>
      <category>Random walks</category>
      <title>DERANDOMIZATION BEYOND CONNECTIVITY: UNDIRECTED LAPLACIAN SYSTEMS IN NEARLY LOGARITHMIC SPACE.</title>
      <description>SIAM Journal on Computing; 11/01/2021&lt;br/&gt;(AN 154329738); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Nov 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_154329738</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=153330905&amp;site=ehost-live</link>
      <author>ASHAROV, GILAD; NAOR, MONI; SEGEV, GIL; SHAHAF, IDO</author>
      <category>Vector spaces</category>
      <category>Keyword searching</category>
      <category>Cryptography</category>
      <title>SEARCHABLE SYMMETRIC ENCRYPTION: OPTIMAL LOCALITY IN LINEAR SPACE VIA TWO-DIMENSIONAL BALANCED ALLOCATIONS.</title>
      <description>SIAM Journal on Computing; 09/01/2021&lt;br/&gt;(AN 153330905); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Sep 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_153330905</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=153330903&amp;site=ehost-live</link>
      <author>GOYAL, VIPUL; RICHELSON, SILAS; ROSEN, ALON; VALD, MARGARITA</author>
      <category>Waste products</category>
      <category>Cryptography</category>
      <category>Argument</category>
      <category>Homomorphisms</category>
      <title>AN ALGEBRAIC APPROACH TO NONMALLEABILITY.</title>
      <description>SIAM Journal on Computing; 09/01/2021&lt;br/&gt;(AN 153330903); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Sep 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_153330903</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=153330904&amp;site=ehost-live</link>
      <author>SITTERS, RENÉ</author>
      <category>Polynomial approximation</category>
      <category>Polynomial time algorithms</category>
      <category>Traveling salesman problem</category>
      <category>Maxima &amp; minima</category>
      <category>Production scheduling</category>
      <category>Approximation algorithms</category>
      <category>Planar graphs</category>
      <title>POLYNOMIAL TIME APPROXIMATION SCHEMES FOR THE TRAVELING REPAIRMAN AND OTHER MINIMUM LATENCY PROBLEMS.</title>
      <description>SIAM Journal on Computing; 09/01/2021&lt;br/&gt;(AN 153330904); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Sep 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_153330904</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=153330907&amp;site=ehost-live</link>
      <author>CZUMAJ, ARTUR; DAVIES, PETER; PARTER, MERAV</author>
      <category>Algorithms</category>
      <category>Distributed computing</category>
      <category>Deterministic algorithms</category>
      <category>Programming languages</category>
      <title>SIMPLE, DETERMINISTIC, CONSTANT-ROUND COLORING IN CONGESTED CLIQUE AND MPC.</title>
      <description>SIAM Journal on Computing; 09/01/2021&lt;br/&gt;(AN 153330907); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Sep 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_153330907</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=153330906&amp;site=ehost-live</link>
      <author>DALIRROOYFARD, MINA; VUONG, THUY DUONG; WILLIAMS, VIRGINIA VASSILEVSKA</author>
      <category>Directed graphs</category>
      <category>Circuit complexity</category>
      <category>Graph theory</category>
      <category>Algorithms</category>
      <category>Hardness</category>
      <category>Patterns (Mathematics)</category>
      <title>GRAPH PATTERN DETECTION: HARDNESS FOR ALL INDUCED PATTERNS AND FASTER NONINDUCED CYCLES.</title>
      <description>SIAM Journal on Computing; 09/01/2021&lt;br/&gt;(AN 153330906); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Wed, 01 Sep 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_153330906</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331790&amp;site=ehost-live</link>
      <author>BACKURS, ARTURS; RODITTY, LIAM; SEGAL, GILAD; WILLIAMS, VIRGINIA VASSILEVSKA; WEIN, NICOLE</author>
      <category>Portland (Or.)</category>
      <category>Cairo (Egypt)</category>
      <category>Sparse graphs</category>
      <category>Dense graphs</category>
      <category>Sparse approximations</category>
      <category>Approximation algorithms</category>
      <category>Diameter</category>
      <category>Algorithms</category>
      <title>TOWARD TIGHT APPROXIMATION BOUNDS FOR GRAPH DIAMETER AND ECCENTRICITIES.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331790); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331790</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331791&amp;site=ehost-live</link>
      <author>SIU-WING CHENG; MAN-KIT LAU</author>
      <category>Decision trees</category>
      <category>Data structures</category>
      <category>Sawlogs</category>
      <title>ADAPTIVE PLANAR POINT LOCATION.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331791); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331791</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331792&amp;site=ehost-live</link>
      <author>LOVETT, SHACHAR</author>
      <category>Sparse matrices</category>
      <category>Information theory</category>
      <category>Coding theory</category>
      <category>Logical prediction</category>
      <category>Linear codes</category>
      <category>Mathematical proofs</category>
      <category>Rectangles</category>
      <title>SPARSE MDS MATRICES OVER SMALL FIELDS: A PROOF OF THE GM-MDS CONJECTURE.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331792); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331792</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331793&amp;site=ehost-live</link>
      <author>KOZIK, MARCIN</author>
      <category>Thailand</category>
      <category>Computer science</category>
      <category>Polynomial approximation</category>
      <category>Constraint satisfaction</category>
      <category>Algebra</category>
      <category>Logic</category>
      <category>Algorithms</category>
      <category>Approximation algorithms</category>
      <title>SOLVING CSPs USING WEAK LOCAL CONSISTENCY.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331793); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331793</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331794&amp;site=ehost-live</link>
      <author>YI LI; RUOSONG WANG; WOODRUFF, DAVID P.</author>
      <category>Matrix multiplications</category>
      <category>Data structures</category>
      <category>Integers</category>
      <category>Open-ended questions</category>
      <category>Regression analysis</category>
      <category>Functional analysis</category>
      <category>Streaming video &amp; television</category>
      <title>TIGHT BOUNDS FOR THE SUBSPACE SKETCH PROBLEM WITH APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331794); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331794</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331795&amp;site=ehost-live</link>
      <author>CHAUDHURY, BHASKAR RAY; KAVITHA, TELIKEPALLI; MEHLHORN, KURT; SGOURITSA, ALKMINI</author>
      <category>Charity</category>
      <category>Charities</category>
      <category>Charitable giving</category>
      <category>Suretyship &amp; guaranty</category>
      <category>Algorithms</category>
      <title>A LITTLE CHARITY GUARANTEES ALMOST ENVY-FREENESS.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331795); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331795</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331796&amp;site=ehost-live</link>
      <author>BODIRSKY, MANUEL; MADELAINE, FLORENT; MOTTET, ANTOINE</author>
      <category>Finite model theory</category>
      <category>Logical prediction</category>
      <category>Constraint satisfaction</category>
      <category>Evidence</category>
      <category>Graph theory</category>
      <category>Ramsey theory</category>
      <title>A PROOF OF THE ALGEBRAIC TRACTABILITY CONJECTURE FOR MONOTONE MONADIC SNP.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331796); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331796</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331797&amp;site=ehost-live</link>
      <author>BAUSCH, JOHANNES; LEDITZKY, FELIX</author>
      <category>Qubits</category>
      <category>Tree graphs</category>
      <category>Quantum computing</category>
      <category>Noise</category>
      <category>Algorithms</category>
      <category>Channel coding</category>
      <category>Representations of graphs</category>
      <category>Computational group theory</category>
      <title>ERROR THRESHOLDS FOR ARBITRARY PAULI NOISE.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331797); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331797</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=152331798&amp;site=ehost-live</link>
      <author>LIMAYE, NUTAN; SREENIVASAIAH, KARTEEK; SRINIVASAN, SRIKANTH; TRIPATHI, UTKARSH; VENKITESH, S.</author>
      <category>New York (State)</category>
      <category>Thailand</category>
      <category>Problem solving</category>
      <category>Coins</category>
      <category>Programming languages</category>
      <title>A FIXED-DEPTH SIZE-HIERARCHY THEOREM FOR AC0[⊕] VIA THE COIN PROBLEM.</title>
      <description>SIAM Journal on Computing; 07/01/2021&lt;br/&gt;(AN 152331798); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Thu, 01 Jul 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_152331798</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360150&amp;site=ehost-live</link>
      <author>DOBZINSKI, SHAHAR</author>
      <category>New York (State)</category>
      <category>Berlin (Germany)</category>
      <category>Auctions</category>
      <category>Bidders</category>
      <category>On-demand computing</category>
      <category>Approximation algorithms</category>
      <title>BREAKING THE LOGARITHMIC BARRIER FOR TRUTHFUL COMBINATORIAL AUCTIONS WITH SUBMODULAR BIDDERS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360150); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360150</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360151&amp;site=ehost-live</link>
      <author>LEQI ZHU</author>
      <category>Distributed computing</category>
      <title>A TIGHT SPACE BOUND FOR CONSENSUS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360151); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360151</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360152&amp;site=ehost-live</link>
      <author>COHEN, GIL</author>
      <category>Ramsey numbers</category>
      <category>Entropy (Information theory)</category>
      <category>Programming languages</category>
      <category>Computer science</category>
      <title>TWO-SOURCE DISPERSERS FOR POLYLOGARITHMIC ENTROPY AND IMPROVED RAMSEY GRAPHS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360152); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360152</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360153&amp;site=ehost-live</link>
      <author>DUGHMI, SHADDIN; HAIFENG XU</author>
      <category>New York (State)</category>
      <category>Persuasion (Psychology)</category>
      <category>Marginal distributions</category>
      <category>Boolean functions</category>
      <category>Computational complexity</category>
      <category>Expected utility</category>
      <category>Approximation algorithms</category>
      <title>ALGORITHMIC BAYESIAN PERSUASION.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360153); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360153</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360154&amp;site=ehost-live</link>
      <author>HENZINGER, MONIKA; KRINNINGER, SEBASTIAN; NANONGKAI, DANUPON</author>
      <category>Thailand</category>
      <category>Germany</category>
      <category>Algorithms</category>
      <category>Deterministic algorithms</category>
      <category>Distributed algorithms</category>
      <category>Deterministic processes</category>
      <category>Mathematics</category>
      <title>A DETERMINISTIC ALMOST-TIGHT DISTRIBUTED ALGORITHM FOR APPROXIMATING SINGLE-SOURCE SHORTEST PATHS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360154); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360154</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360155&amp;site=ehost-live</link>
      <author>BANSAL, NIKHIL; SRINIVASAN, ARAVIND; SVENSSON, OLA</author>
      <category>Convex programming</category>
      <category>Algorithms</category>
      <category>Machinery</category>
      <category>Approximation algorithms</category>
      <category>Time</category>
      <title>LIFT-AND-ROUND TO IMPROVE WEIGHTED COMPLETION TIME ON UNRELATED MACHINES.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360155); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360155</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360156&amp;site=ehost-live</link>
      <author>YANG CAI; DEVANUR, NIKHIL R.; WEINBERG, S. MATTHEW</author>
      <category>Electronic commerce</category>
      <category>Incentive (Psychology)</category>
      <category>Computer science</category>
      <category>Auctions</category>
      <title>A DUALITY-BASED UNIFIED APPROACH TO BAYESIAN MECHANISM DESIGN.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360156); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360156</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360157&amp;site=ehost-live</link>
      <author>LEVEY, ELAINE; ROTHVOSS, THOMAS</author>
      <category>Production scheduling</category>
      <category>Online algorithms</category>
      <category>Approximation algorithms</category>
      <category>Polynomial time algorithms</category>
      <category>NP-hard problems</category>
      <category>Algorithms</category>
      <category>Scheduling</category>
      <title>A (1+EPSILON)-APPROXIMATION FOR MAKESPAN SCHEDULING WITH PRECEDENCE CONSTRAINTS USING LP HIERARCHIES.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360157); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360157</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360158&amp;site=ehost-live</link>
      <author>FENNER, STEPHEN; GURJAR, ROHIT; THIERAUF, THOMAS</author>
      <category>Bipartite graphs</category>
      <category>Parallel algorithms</category>
      <category>Circuit complexity</category>
      <title>BIPARTITE PERFECT MATCHING IS IN QUASI-NC.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360158); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360158</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360159&amp;site=ehost-live</link>
      <author>GANOR, ANAT; KOL, GILLAT; RAZ, RAN</author>
      <category>Thailand</category>
      <category>Tasks</category>
      <category>Conferences &amp; conventions</category>
      <title>EXPONENTIAL SEPARATION OF COMMUNICATION AND EXTERNAL INFORMATION.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360159); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360159</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360160&amp;site=ehost-live</link>
      <author>REINGOLD, OMER; ROTHBLUM, GUY N.; ROTHBLUM, RON D.</author>
      <category>Lund (Sweden)</category>
      <category>Evidence</category>
      <category>Polynomial time algorithms</category>
      <category>Systems design</category>
      <title>CONSTANT-ROUND INTERACTIVE PROOFS FOR DELEGATING COMPUTATION.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360160); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360160</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360161&amp;site=ehost-live</link>
      <author>ASSADI, SEPEHR; KHANNA, SANJEEV; YANG LI</author>
      <category>Databases</category>
      <category>Approximation algorithms</category>
      <category>Open-ended questions</category>
      <category>Case goods</category>
      <title>TIGHT BOUNDS FOR SINGLE-PASS STREAMING COMPLEXITY OF THE SET COVER PROBLEM.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360161); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360161</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360162&amp;site=ehost-live</link>
      <author>BASSILY, RAEF; NISSIM, KOBBI; SMITH, ADAM; STEINKE, THOMAS; STEMMER, URI; ULLMAN, JONATHAN</author>
      <category>Data analysis</category>
      <category>Differential forms</category>
      <category>Algorithms</category>
      <category>Generalization</category>
      <category>Independent sets</category>
      <title>ALGORITHMIC STABILITY FOR ADAPTIVE DATA ANALYSIS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360162); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360162</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360163&amp;site=ehost-live</link>
      <author>BELOVS, ALEKSANDRS; BLAIS, ERIC</author>
      <category>Boolean functions</category>
      <category>Algorithms</category>
      <category>Adaptive testing</category>
      <category>Polynomials</category>
      <title>A POLYNOMIAL LOWER BOUND FOR TESTING MONOTONICITY.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360163); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360163</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360164&amp;site=ehost-live</link>
      <author>BECKER, RUBEN; FORSTER, SEBASTIAN; KARRENBAUER, ANDREAS; LENZEN, CHRISTOPH</author>
      <category>Transshipment</category>
      <category>Algorithms</category>
      <category>Problem solving</category>
      <category>Undirected graphs</category>
      <category>Wrenches</category>
      <title>NEAR-OPTIMAL APPROXIMATE SHORTEST PATHS AND TRANSSHIPMENT IN DISTRIBUTED AND STREAMING MODELS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360164); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360164</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360165&amp;site=ehost-live</link>
      <author>SAHAI, AMIT; WATERS, BRENT</author>
      <category>Injective functions</category>
      <category>Public key cryptography</category>
      <category>Cryptography</category>
      <category>Open-ended questions</category>
      <title>HOW TO USE INDISTINGUISHABILITY OBFUSCATION: DENIABLE ENCRYPTION, AND MORE.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360165); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360165</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360166&amp;site=ehost-live</link>
      <author>BUBECK, SÉBASTIEN; COHEN, MICHAEL B.; LEE, JAMES R.; LEE, YIN TAT</author>
      <category>Mendel, Gregor, 1822-1884</category>
      <category>Embedding theorems</category>
      <category>Metric spaces</category>
      <category>Algorithms</category>
      <category>Mirrors</category>
      <category>Queuing theory</category>
      <category>Coincidence theory</category>
      <title>METRICAL TASK SYSTEMS ON TREES VIA MIRROR DESCENT AND UNFAIR GLUING.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360166); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360166</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360167&amp;site=ehost-live</link>
      <author>XIAOHUI BEI; SHITENG CHEN; JI GUAN; YOUMING QIAO; XIAOMING SUN</author>
      <category>Independent sets</category>
      <category>Bipartite graphs</category>
      <category>Graph theory</category>
      <category>Quantum information theory</category>
      <category>Group theory</category>
      <title>FROM INDEPENDENT SETS AND VERTEX COLORINGS TO ISOTROPIC SPACES AND ISOTROPIC DECOMPOSITIONS: ANOTHER BRIDGE BETWEEN GRAPHS AND ALTERNATING MATRIX SPACES.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360167); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360167</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360168&amp;site=ehost-live</link>
      <author>ARUNACHALAM, SRINIVASAN; GRILO, ALEX BREDARIOL; SUNDARAM, AARTHI</author>
      <category>Cryptosystems</category>
      <category>Machine learning</category>
      <category>Distribution (Probability theory)</category>
      <category>Quantum computing</category>
      <category>Quantum theory</category>
      <category>Algorithms</category>
      <title>QUANTUM HARDNESS OF LEARNING SHALLOW CLASSICAL CIRCUITS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360168); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360168</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360169&amp;site=ehost-live</link>
      <author>EPPSTEIN, DAVID; VAZIRANI, VIJAY V.</author>
      <category>Flowgraphs</category>
      <category>Graph algorithms</category>
      <category>Algorithms</category>
      <category>Planar graphs</category>
      <category>Bipartite graphs</category>
      <category>Parallel algorithms</category>
      <title>NC ALGORITHMS FOR COMPUTING A PERFECT MATCHING AND A MAXIMUM FLOW IN ONE-CROSSING-MINOR-FREE GRAPHS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360169); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360169</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360170&amp;site=ehost-live</link>
      <author>TSZ CHIU KWOK; LAP CHI LAU; RAMACHANDRAN, AKSHAY</author>
      <category>Quantum information theory</category>
      <category>Random operators</category>
      <category>Algorithms</category>
      <category>Random matrices</category>
      <category>Matrices (Mathematics)</category>
      <title>SPECTRAL ANALYSIS OF MATRIX SCALING AND OPERATOR SCALING.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360170); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360170</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360171&amp;site=ehost-live</link>
      <author>CENSOR-HILLEL, KEREN; DORY, MICHAL</author>
      <category>Polynomial time algorithms</category>
      <category>Algorithms</category>
      <category>Deterministic algorithms</category>
      <category>Wrenches</category>
      <category>Distributed computing</category>
      <category>Dominating set</category>
      <title>DISTRIBUTED SPANNER APPROXIMATION.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360171); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360171</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=151360172&amp;site=ehost-live</link>
      <category>Algorithms</category>
      <category>Maxima &amp; minima</category>
      <category>Hamiltonian graph theory</category>
      <category>Applied mathematics</category>
      <category>Copyright licenses</category>
      <category>Computer science</category>
      <title>CORRIGENDUM: LDFS-BASED CERTIFYING ALGORITHM FOR THE MINIMUM PATH COVER PROBLEM ON COCOMPARABILITY GRAPHS.</title>
      <description>SIAM Journal on Computing; 05/01/2021&lt;br/&gt;(AN 151360172); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sat, 01 May 2021 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_151360172</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127632&amp;site=ehost-live</link>
      <author>FELDMAN, MORAN; SVENSSON, OLA; ZENKLUSEN, RICO</author>
      <category>Submodular functions</category>
      <category>Stochastic models</category>
      <category>Design techniques</category>
      <category>Online algorithms</category>
      <category>Matroids</category>
      <title>ONLINE CONTENTION RESOLUTION SCHEMES WITH APPLICATIONS TO BAYESIAN SELECTION PROBLEMS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127632); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127632</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127637&amp;site=ehost-live</link>
      <author>DINUR, IRIT; HARSHA, PRAHLADH; KAUFMAN, TALI; NAVON, INBAL LIVNI; TA-SHMA, AMNON</author>
      <category>Decoding algorithms</category>
      <category>Tanner graphs</category>
      <category>Hardness</category>
      <category>Voting</category>
      <title>LIST-DECODING WITH DOUBLE SAMPLERS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127637); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127637</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127640&amp;site=ehost-live</link>
      <author>WEIMING FENG; VISHNOI, NISHEETH K.; YITONG YIN</author>
      <category>Statistical physics</category>
      <category>Ising model</category>
      <category>Computer science</category>
      <category>Random variables</category>
      <category>Machine learning</category>
      <title>DYNAMIC SAMPLING FROM GRAPHICAL MODELS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127640); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127640</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127633&amp;site=ehost-live</link>
      <author>JAYARAM, RAJESH; WOODRUFF, DAVID</author>
      <category>Philadelphia (Pa.)</category>
      <category>Thailand</category>
      <category>Random graphs</category>
      <category>Open-ended questions</category>
      <title>PERFECT Lp SAMPLING IN A DATA STREAM.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127633); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127633</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127628&amp;site=ehost-live</link>
      <author>GABOW, HAROLD N.; SANKOWSKI, PIOTR</author>
      <category>Bipartite graphs</category>
      <category>Multigraph</category>
      <category>Algorithms</category>
      <category>Undirected graphs</category>
      <category>Matrix multiplications</category>
      <category>Weighted graphs</category>
      <category>Generalization</category>
      <title>ALGORITHMS FOR WEIGHTED MATCHING GENERALIZATIONS I: BIPARTITE GRAPHS, b-MATCHING, AND UNWEIGHTED f-FACTORS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127628); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127628</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127641&amp;site=ehost-live</link>
      <author>OKRASA, KAROLINA; RZĄŻEWSKI, PAWEŁ</author>
      <category>Graph theory</category>
      <category>Homomorphisms</category>
      <category>Dynamic programming</category>
      <title>FINE-GRAINED COMPLEXITY OF THE GRAPH HOMOMORPHISM PROBLEM FOR BOUNDED-TREEWIDTH GRAPHS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127641); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127641</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127630&amp;site=ehost-live</link>
      <author>GAWRYCHOWSKI, PAWEŁ; KAPLAN, HAIM; MOZES, SHAY; SHARIR, MICHA; WEIMANN, OREN</author>
      <category>Philadelphia (Pa.)</category>
      <category>Thailand</category>
      <category>Voronoi polygons</category>
      <category>Arc length</category>
      <category>Planar graphs</category>
      <category>Deterministic algorithms</category>
      <category>Diameter</category>
      <category>Directed graphs</category>
      <category>Algorithms</category>
      <title>VORONOI DIAGRAMS ON PLANAR GRAPHS, AND COMPUTING THE DIAMETER IN DETERMINISTIC Õ(n5/3) TIME.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127630); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127630</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127629&amp;site=ehost-live</link>
      <author>GABOW, HAROLD N.; SANKOWSKI, PIOTR</author>
      <category>Multigraph</category>
      <category>Paths &amp; cycles in graph theory</category>
      <category>Undirected graphs</category>
      <category>Matrix multiplications</category>
      <category>Algorithms</category>
      <category>Structural optimization</category>
      <category>Generalization</category>
      <title>ALGORITHMS FOR WEIGHTED MATCHING GENERALIZATIONS II: f-FACTORS AND THE SPECIAL CASE OF SHORTEST PATHS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127629); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127629</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127631&amp;site=ehost-live</link>
      <author>HAITAO WANG; JINGRU ZHANG</author>
      <category>Megiddo (Extinct city)</category>
      <category>Thailand</category>
      <category>Algorithms</category>
      <category>Computational geometry</category>
      <title>AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127631); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127631</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127638&amp;site=ehost-live</link>
      <author>GURJAR, ROHIT; THIERAUF, THOMAS; VISHNOI, NISHEETH K.</author>
      <category>Polytopes</category>
      <category>Circuit complexity</category>
      <category>Geometric approach</category>
      <category>Regular graphs</category>
      <category>Matroids</category>
      <category>Short circuits</category>
      <title>ISOLATING A VERTEX VIA LATTICES: POLYTOPES WITH TOTALLY UNIMODULAR FACES.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127638); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127638</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127634&amp;site=ehost-live</link>
      <author>BODWIN, GREG</author>
      <category>Weighted graphs</category>
      <category>Directed graphs</category>
      <category>Distances</category>
      <category>Undirected graphs</category>
      <title>NEW RESULTS ON LINEAR SIZE DISTANCE PRESERVERS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127634); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127634</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127642&amp;site=ehost-live</link>
      <author>DAWEI HUANG; PETTIE, SETH; YIXIANG ZHANG; ZHIJUN ZHANG</author>
      <category>Deterministic algorithms</category>
      <category>Distributed computing</category>
      <category>Error probability</category>
      <category>Computer science</category>
      <category>Algorithms</category>
      <title>THE COMMUNICATION COMPLEXITY OF SET INTERSECTION AND MULTIPLE EQUALITY TESTING.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127642); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127642</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127636&amp;site=ehost-live</link>
      <author>HALLDÓRSSON, MAGNÚS M.; TONOYAN, TIGRAN</author>
      <category>Approximation algorithms</category>
      <category>Scheduling</category>
      <category>Resource management</category>
      <category>Power tools</category>
      <title>EFFECTIVE WIRELESS SCHEDULING VIA HYPERGRAPH SKETCHES.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127636); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127636</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127635&amp;site=ehost-live</link>
      <author>AGARWAL, PANKAJ K.; ARONOV, BORIS; EZRA, ESTHER; ZAHL, JOSHUA</author>
      <category>Semialgebraic sets</category>
      <category>Polynomials</category>
      <category>Algorithms</category>
      <category>Data structures</category>
      <title>EFFICIENT ALGORITHM FOR GENERALIZED POLYNOMIAL PARTITIONING AND ITS APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127635); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127635</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=150127639&amp;site=ehost-live</link>
      <author>GUR, TOM; LACHISH, ODED</author>
      <category>Decoding algorithms</category>
      <category>Evidence</category>
      <title>ON THE POWER OF RELAXED LOCAL DECODING ALGORITHMS.</title>
      <description>SIAM Journal on Computing; 03/01/2021&lt;br/&gt;(AN 150127639); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Mon, 01 Mar 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_150127639</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427327&amp;site=ehost-live</link>
      <author>COHEN-ADDAD, VINCENT; DE VERDIÈRE, ÉRIC COLIN; DE MESMAY, ARNAUD</author>
      <category>Undirected graphs</category>
      <category>Planar graphs</category>
      <category>Algorithms</category>
      <category>Maxima &amp; minima</category>
      <category>Approximation algorithms</category>
      <category>Computational topology</category>
      <title>A NEAR-LINEAR APPROXIMATION SCHEME FOR MULTICUTS OF EMBEDDED GRAPHS WITH A FIXED NUMBER OF TERMINALS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427327); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427327</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427328&amp;site=ehost-live</link>
      <author>APPLEBAUM, BENNY; ARKIS, BARAK; RAYKOV, PAVEL; VASUDEVAN, PRASHANT NALINI</author>
      <category>New York (State)</category>
      <category>Information-theoretic security</category>
      <category>Amortization</category>
      <category>Carols</category>
      <category>Proton-proton interactions</category>
      <title>CONDITIONAL DISCLOSURE OF SECRETS: AMPLIFICATION, CLOSURE, AMORTIZATION, LOWER-BOUNDS, AND SEPARATIONS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427328); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427328</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427330&amp;site=ehost-live</link>
      <author>APPLEBAUM, BENNY; BRAKERSKI, ZVIKA; TSABARY, ROTEM</author>
      <category>IEEE Computer Society</category>
      <category>Computer science</category>
      <category>Information-theoretic security</category>
      <category>Open-ended questions</category>
      <category>Cybernetics</category>
      <category>Polynomials</category>
      <title>PERFECT SECURE COMPUTATION IN TWO ROUNDS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427330); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427330</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427329&amp;site=ehost-live</link>
      <author>BITANSKY, NIR; DEGWEKAR, AKSHAY; VAIKUNTANATHAN, VINOD</author>
      <category>RSA algorithm</category>
      <category>Hardness</category>
      <category>Riesz spaces</category>
      <category>Cryptography</category>
      <title>STRUCTURE VERSUS HARDNESS THROUGH THE OBFUSCATION LENS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427329); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427329</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427331&amp;site=ehost-live</link>
      <author>GONZÁLEZ-AGUILAR, HERNÁN; ORDEN, DAVID; PÉREZ-LANTERO, PABLO; RAPPAPORT, DAVID; SEARA, CARLOS; TEJEL, JAVIER; URRUTIA, JORGE</author>
      <category>Problem solving</category>
      <category>Point set theory</category>
      <category>Polygons</category>
      <category>Algorithms</category>
      <category>Staircases</category>
      <title>MAXIMUM RECTILINEAR CONVEX SUBSETS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427331); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427331</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427332&amp;site=ehost-live</link>
      <author>CHATTOPADHYAY, ARKADEV; FILMUS, YUVAL; KOROTH, SAJIN; MEIR, OR; PITASSI, TONIANN</author>
      <category>Implements, utensils, etc.</category>
      <category>Generalization</category>
      <category>Motivation (Psychology)</category>
      <title>QUERY-TO-COMMUNICATION LIFTING USING LOW-DISCREPANCY GADGETS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427332); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427332</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=149427333&amp;site=ehost-live</link>
      <author>DÜTTING, P.; ROUGHGARDEN, T.; TALGAM-COHEN, I.</author>
      <category>Polynomial time algorithms</category>
      <category>Contracts</category>
      <category>Computational complexity</category>
      <category>Contract theory</category>
      <category>Moral hazard</category>
      <title>THE COMPLEXITY OF CONTRACTS.</title>
      <description>SIAM Journal on Computing; 01/01/2021&lt;br/&gt;(AN 149427333); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Fri, 01 Jan 2021 00:00:00 -0500</pubDate>
      <guid isPermaLink="false">aph_AN_149427333</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837838&amp;site=ehost-live</link>
      <author>HAITNER, IFTACH; NISSIM, KOBBI; OMRI, ERAN; SHALTIEL, RONEN; SILBAK, JAD</author>
      <category>Damascus (Syria)</category>
      <category>Switzerland</category>
      <category>Quantum cryptography</category>
      <category>Open-ended questions</category>
      <category>Cryptography</category>
      <title>COMPUTATIONAL TWO-PARTY CORRELATION: A DICHOTOMY FOR KEY-AGREEMENT PROTOCOLS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837838); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837838</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837839&amp;site=ehost-live</link>
      <author>JANSEN, KLAUS; ROHWEDDER, LARS</author>
      <category>Assignment problems (Programming)</category>
      <category>Evidence</category>
      <title>A QUASI-POLYNOMIAL APPROXIMATION FOR THE RESTRICTED ASSIGNMENT PROBLEM.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837839); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837839</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837840&amp;site=ehost-live</link>
      <author>ARONOV, BORIS; EZRA, ESTHER; ZAHL, JOSHUA</author>
      <category>Polynomials</category>
      <category>Algebraic curves</category>
      <category>Combinatorial geometry</category>
      <category>Mathematics</category>
      <category>Algorithms</category>
      <category>Integers</category>
      <title>CONSTRUCTIVE POLYNOMIAL PARTITIONING FOR ALGEBRAIC CURVES IN R³ WITH APPLICATIONS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837840); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837840</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837841&amp;site=ehost-live</link>
      <author>HUBÁČEK, PAVEL; YOGEV, EYLON</author>
      <category>Simplex algorithm</category>
      <category>Hardness</category>
      <category>Computational complexity</category>
      <category>Simulated annealing</category>
      <category>Continuous functions</category>
      <category>Genetic algorithms</category>
      <title>HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837841); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837841</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837842&amp;site=ehost-live</link>
      <author>SHERSTOV, ALEXANDER A.</author>
      <category>Polynomial approximation</category>
      <category>Polynomials</category>
      <category>Boolean functions</category>
      <category>Surjections</category>
      <category>Algorithms</category>
      <title>ALGORITHMIC POLYNOMIALS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837842); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837842</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837843&amp;site=ehost-live</link>
      <author>BRAKENSIEK, JOSHUA; GURUSWAMI, VENKATESAN; WROCHNA, MARCIN; ŽIVNÝ, STANISLAV</author>
      <category>Constraint satisfaction</category>
      <category>Affinal relatives</category>
      <category>Statistical decision making</category>
      <category>Graph coloring</category>
      <category>Polynomial time algorithms</category>
      <title>THE POWER OF THE COMBINED BASIC LINEAR PROGRAMMING AND AFFINE RELAXATION FOR PROMISE CONSTRAINT SATISFACTION PROBLEMS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837843); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837843</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837844&amp;site=ehost-live</link>
      <author>EBRAHIMI, JAVAD; STRASZAK, DAMIAN; VISHNOI, NISHEETH</author>
      <category>Maximal functions</category>
      <category>Absolute value</category>
      <category>Approximation algorithms</category>
      <category>Computer science</category>
      <category>Matroids</category>
      <category>NP-hard problems</category>
      <category>Random variables</category>
      <title>SUBDETERMINANT MAXIMIZATION VIA NONCONVEX RELAXATIONS AND ANTI-CONCENTRATION.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837844); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837844</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837845&amp;site=ehost-live</link>
      <author>ARONOV, BORIS; BAR-ON, GALI; KATZ, MATTHEW J.</author>
      <category>Power transmission</category>
      <category>Data structures</category>
      <category>Transmitters (Communication)</category>
      <category>Computational geometry</category>
      <title>RESOLVING SINR QUERIES IN A DYNAMIC SETTING.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837845); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837845</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837846&amp;site=ehost-live</link>
      <author>DE BERG, MARK; BODLAENDER, HANS L.; KISFALUDI-BAK, SÁNDOR; MARX, DÁNIEL; VAN DER ZANDEN, TOM C.</author>
      <category>Independent sets</category>
      <category>Algorithms</category>
      <category>Intersection graph theory</category>
      <category>Kolmogorov complexity</category>
      <category>Graph algorithms</category>
      <title>A FRAMEWORK FOR EXPONENTIAL-TIME-HYPOTHESIS-TIGHT ALGORITHMS AND LOWER BOUNDS IN GEOMETRIC INTERSECTION GRAPHS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837846); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837846</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837847&amp;site=ehost-live</link>
      <author>KLASSEN, JOEL; MARVIAN, MILAD; PIDDOCK, STEPHEN; IOANNOU, MARIOS; HEN, ITAY; TERHAL, BARBARA M.</author>
      <category>Monte Carlo method</category>
      <category>Unitary transformations</category>
      <category>Hardness</category>
      <category>Qubits</category>
      <category>Computational complexity</category>
      <title>HARDNESS AND EASE OF CURING THE SIGN PROBLEM FOR TWO-LOCAL QUBIT HAMILTONIANS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837847); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837847</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837848&amp;site=ehost-live</link>
      <author>RAN DUAN; PETTIE, SETH</author>
      <category>Monte Carlo method</category>
      <category>Graph connectivity</category>
      <category>Undirected graphs</category>
      <category>Deterministic processes</category>
      <category>Data structures</category>
      <category>Batch processing</category>
      <category>Deterministic algorithms</category>
      <title>CONNECTIVITY ORACLES FOR GRAPHS SUBJECT TO VERTEX FAILURES.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837848); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837848</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837849&amp;site=ehost-live</link>
      <author>FOMIN, FEDOR V.; LOKSHTANOV, DANIEL; SAURABH, SAKET; THILIKOS, DIMITRIOS M.</author>
      <category>Thailand</category>
      <category>Philadelphia (Pa.)</category>
      <category>Polynomial approximation</category>
      <category>Polynomial time algorithms</category>
      <category>Graph algorithms</category>
      <category>Algorithms</category>
      <title>BIDIMENSIONALITY AND KERNELS.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837849); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837849</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147837850&amp;site=ehost-live</link>
      <category>Thailand</category>
      <category>Games</category>
      <category>Open-ended questions</category>
      <category>Evidence</category>
      <title>ERRATUM: THREE-PLAYER ENTANGLED XOR GAMES ARE NP-HARD TO APPROXIMATE.</title>
      <description>SIAM Journal on Computing; 11/01/2020&lt;br/&gt;(AN 147837850); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Sun, 01 Nov 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147837850</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147613060&amp;site=ehost-live</link>
      <author>CZUMAJ, ARTUR; LACKI, JAKUB; MADRY, ALEKSANDER; MITROVIć, SLOBODAN; ONAK, KRZYSZTOF; SANKOWSKI, PIOTR</author>
      <category>New York (State)</category>
      <category>Distributed algorithms</category>
      <category>Parallel algorithms</category>
      <title>ROUND COMPRESSION FOR PARALLEL MATCHING ALGORITHMS.</title>
      <description>SIAM Journal on Computing; 09/01/2020&lt;br/&gt;(AN 147613060); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Sep 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147613060</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;AN=147613059&amp;site=ehost-live</link>
      <author>Vidick, Thomas; Nanongkai, Danupon; Achlioptas, Dimitris</author>
      <category>Conferences &amp; conventions</category>
      <category>Parallel algorithms</category>
      <category>Simplex algorithm</category>
      <category>Real numbers</category>
      <category>Algorithms</category>
      <title>SPECIAL SECTION ON THE FIFTIETH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (2018).</title>
      <description>SIAM Journal on Computing; 09/01/2020&lt;br/&gt;(AN 147613059); ISSN: 00975397&lt;br/&gt;Academic Search Premier</description>
      <pubDate>Tue, 01 Sep 2020 00:00:00 -0400</pubDate>
      <guid isPermaLink="false">aph_AN_147613059</guid>
    </item>
    <item>
      <link>https://search.ebscohost.com/login.aspx?direct=true&amp;db=aph&amp;bquery=JN+%26quot%3bSIAM+Journal+on+Computing%26quot%3b&amp;site=ehost-live&amp;scope=site</link>
      <title>More Results...</title>
      <description>We have found more results for your search</description>
      <guid>more results</guid>
    </item>
  </channel>
</rss>