Parameter Estimation for Gibbs Distributions (Englisch)
Freier Zugriff
- Neue Suche nach: Harris, David G.
- Neue Suche nach: Kolmogorov, Vladimir
- Neue Suche nach: Harris, David G.
- Neue Suche nach: Kolmogorov, Vladimir
- Neue Suche nach: Etessami, Kousha
- Neue Suche nach: Feige, Uriel
- Neue Suche nach: Puppis, Gabriele
- Weitere Informationen zu Puppis, Gabriele:
- https://orcid.org/0000-0001-9831-3264
In:
LIPIcs, Volume 261, ICALP 2023
: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
;
261
;
72:1-72:21
;
2023
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Parameter Estimation for Gibbs Distributions
-
Beteiligte:Harris, David G. ( Autor:in ) / Kolmogorov, Vladimir ( Autor:in ) / Etessami, Kousha ( Herausgeber:in ) / Feige, Uriel ( Herausgeber:in ) / Puppis, Gabriele ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 261, ICALP 2023 : 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) ; 261 ; 72:1-72:21Leibniz International Proceedings in Informatics (LIPIcs) ; 261 ; 72:1-72:21
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:05.07.2023
-
Format / Umfang:21 pages , 917791 byte
-
Anmerkungen:LIPIcs, Vol. 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), pages 72:1-72:21
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk)Karlin, Anna R. et al. | 2023
- 2
-
An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)Kyng, Rasmus et al. | 2023
- 3
-
Context-Bounded Analysis of Concurrent Programs (Invited Talk)Baumann, Pascal / Ganardi, Moses / Majumdar, Rupak / Thinniyam, Ramanathan S. / Zetzsche, Georg et al. | 2023
- 4
-
Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk)Vidick, Thomas et al. | 2023
- 5
-
The Skolem Landscape (Invited Talk)Worrell, James et al. | 2023
- 6
-
Optimal Decremental Connectivity in Non-Sparse GraphsAamand, Anders / Karczmarz, Adam / Łącki, Jakub / Parotsidis, Nikos / Rasmussen, Peter M. R. / Thorup, Mikkel et al. | 2023
- 7
-
On Range Summary QueriesAfshani, Peyman / Cheng, Pingan / Basu Roy, Aniket / Wei, Zhewei et al. | 2023
- 8
-
Stable Matching: Choosing Which Proposals to MakeAgarwal, Ishan / Cole, Richard et al. | 2023
- 9
-
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut PlayerAgassy, Daniel / Dorfman, Dani / Kaplan, Haim et al. | 2023
- 10
-
Locality in Online, Dynamic, Sequential, and Distributed Graph AlgorithmsAkbari, Amirreza / Eslami, Navid / Lievonen, Henrik / Melnyk, Darya / Särkijärvi, Joona / Suomela, Jukka et al. | 2023
- 11
-
An Efficient Algorithm for All-Pairs Bounded Edge ConnectivityAkmal, Shyan / Jin, Ce et al. | 2023
- 12
-
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-MultilinearizationAmireddy, Prashanth / Garg, Ankit / Kayal, Neeraj / Saha, Chandan / Thankey, Bhargav et al. | 2023
- 13
-
Multi Layer Peeling for Linear Arrangement and Hierarchical ClusteringAzar, Yossi / Vainstein, Danny et al. | 2023
- 14
-
Robust Communication Complexity of Matching: EDCS Achieves 5/6 ApproximationAzarmehr, Amir / Behnezhad, Soheil et al. | 2023
- 15
-
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable FunctionsBansal, Ishan / Cheriyan, Joseph / Grout, Logan / Ibrahimpur, Sharat et al. | 2023
- 16
-
Approximation Algorithms for Envy-Free Cake Division with Connected PiecesBarman, Siddharth / Kulkarni, Pooja et al. | 2023
- 17
-
Cumulative Memory Lower Bounds for Randomized and Quantum ComputationBeame, Paul / Kornerup, Niels et al. | 2023
- 18
-
Dynamic Averaging Load Balancing on Arbitrary GraphsBerenbrink, Petra / Hintze, Lukas / Hosseinpour, Hamed / Kaaser, Dominik / Rau, Malin et al. | 2023
- 19
-
Fast Approximation of Search Trees on Trees with Centroid TreesBerendsohn, Benjamin Aram / Golinsky, Ishay / Kaplan, Haim / Kozma, László et al. | 2023
- 20
-
Improved Product-State Approximation Algorithms for Quantum Local HamiltoniansBergamaschi, Thiago et al. | 2023
- 21
-
Sublinear Time Eigenvalue Approximation via Random SamplingBhattacharjee, Rajarshi / Dexter, Gregory / Drineas, Petros / Musco, Cameron / Ray, Archan et al. | 2023
- 22
-
Streaming k-Edit Approximate Pattern Matching via String DecompositionBhattacharya, Sudatta / Koucký, Michal et al. | 2023
- 23
-
On Computing the Vertex Connectivity of 1-Plane GraphsBiedl, Therese / Murali, Karthik et al. | 2023
- 24
-
Fault-Tolerant ST-Diameter OraclesBilò, Davide / Choudhary, Keerti / Cohen, Sarel / Friedrich, Tobias / Krogmann, Simon / Schirneck, Martin et al. | 2023
- 25
-
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity TestingBlack, Hadley / Kalemaj, Iden / Raskhodnikova, Sofya et al. | 2023
- 26
-
The Geometry of Tree-Based SortingBlelloch, Guy E. / Dobson, Magdalen et al. | 2023
- 27
-
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related ParametersBodlaender, Hans L. / Groenland, Carla / Pilipczuk, Michał et al. | 2023
- 28
-
Nondeterministic Interactive Refutations for Nearest Boolean VectorBogdanov, Andrej / Rosen, Alon et al. | 2023
- 29
-
A 4/3 Approximation for 2-Vertex-ConnectivityBosch-Calvo, Miguel / Grandoni, Fabrizio / Jabal Ameli, Afrouz et al. | 2023
- 30
-
Lower Bounds for Pseudo-Deterministic Counting in a StreamBraverman, Vladimir / Krauthgamer, Robert / Krishnan, Aditya / Sapir, Shay et al. | 2023
- 31
-
Minimum Chain Cover in Almost Linear TimeCáceres, Manuel et al. | 2023
- 32
-
Improved Hardness Results for the Guided Local Hamiltonian ProblemCade, Chris / Folkertsma, Marten / Gharibian, Sevag / Hayakawa, Ryu / Le Gall, François / Morimae, Tomoyuki / Weggemans, Jordi et al. | 2023
- 33
-
Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant ViewpointCai, Jin-Yi / Young, Ben et al. | 2023
- 34
-
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small kChan, Timothy M. / He, Qizheng / Yu, Yuancheng et al. | 2023
- 35
-
Ortho-Radial Drawing in Near-Linear TimeChang, Yi-Jun et al. | 2023
- 36
-
Approximation Algorithms for Network Design in Non-Uniform Fault ModelsChekuri, Chandra / Jain, Rhea et al. | 2023
- 37
-
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General MetricsChen, Yu / Khanna, Sanjeev / Tan, Zihan et al. | 2023
- 38
-
Quantum Algorithms and Lower Bounds for Linear Regression with Norm ConstraintsChen, Yanlin / de Wolf, Ronald et al. | 2023
- 39
-
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching ProgramsChen, Lijie / Lyu, Xin / Tal, Avishay / Wu, Hongxun et al. | 2023
- 40
-
Approximate Nearest Neighbor for Polygonal Curves Under Fréchet DistanceCheng, Siu-Wing / Huang, Haoqiang et al. | 2023
- 41
-
Linear Insertion Deletion Codes in the High-Noise and High-Rate RegimesCheng, Kuan / Jin, Zhengzhong / Li, Xin / Wei, Zhide / Zheng, Yu et al. | 2023
- 42
-
Online Learning and Disambiguations of Partial Concept ClassesCheung, Tsun-Ming / Hatami, Hamed / Hatami, Pooya / Hosseini, Kaave et al. | 2023
- 43
-
A General Framework for Learning-Augmented Online AllocationCohen, Ilan Reuven / Panigrahi, Debmalya et al. | 2023
- 44
-
Sample-Based Distance-Approximation for Subsequence-FreenessCohen Sidon, Omer / Ron, Dana et al. | 2023
- 45
-
New Partitioning Techniques and Faster Algorithms for Approximate Interval SchedulingCompton, Spencer / Mitrović, Slobodan / Rubinfeld, Ronitt et al. | 2023
- 46
-
Optimal (Degree+1)-Coloring in Congested CliqueCoy, Sam / Czumaj, Artur / Davies, Peter / Mishra, Gopinath et al. | 2023
- 47
-
Incremental Maximization via ContinuizationDisser, Yann / Klimm, Max / Schewior, Kevin / Weckbecker, David et al. | 2023
- 48
-
Local Computation Algorithms for Hypergraph Coloring - Following Beck’s ApproachDorobisz, Andrzej / Kozik, Jakub et al. | 2023
- 49
-
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative SetsDoron-Arad, Ilan / Kulik, Ariel / Shachnai, Hadas et al. | 2023
- 50
-
Connected k-Center and k-Diameter ClusteringDrexler, Lukas / Eube, Jan / Luo, Kelin / Röglin, Heiko / Schmidt, Melanie / Wargalla, Julian et al. | 2023
- 51
-
On Sparsification of Stochastic Packing ProblemsDughmi, Shaddin / Kalayci, Yusuf Hakan / Patel, Neel et al. | 2023
- 52
-
Triangle Counting with Local Edge Differential PrivacyEden, Talya / Liu, Quanquan C. / Raskhodnikova, Sofya / Smith, Adam et al. | 2023
- 53
-
Protecting Single-Hop Radio Networks from Message DropsEfremenko, Klim / Kol, Gillat / Paramonov, Dmitry / Saxena, Raghuvansh R. et al. | 2023
- 54
-
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n)Efthymiou, Charilaos / Feng, Weiming et al. | 2023
- 55
-
Broadcasting with Random MatricesEfthymiou, Charilaos / Zampetakis, Kostas et al. | 2023
- 56
-
Improved Mixing for the Convex Polygon Triangulation Flip WalkEppstein, David / Frishberg, Daniel et al. | 2023
- 57
-
Optimal Adjacency Labels for Subgraphs of Cartesian ProductsEsperet, Louis / Harms, Nathaniel / Zamaraev, Viktor et al. | 2023
- 58
-
Truthful Matching with Online Items and Offline AgentsFeldman, Michal / Fusco, Federico / Mauras, Simon / Reiffenhäuser, Rebecca et al. | 2023
- 59
-
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper BoundsFerens, Robert / Szykuła, Marek et al. | 2023
- 60
-
Approximating Long Cycle Above Dirac’s GuaranteeFomin, Fedor V. / Golovach, Petr A. / Sagunov, Danil / Simonov, Kirill et al. | 2023
- 61
-
Compound Logics for Modification ProblemsFomin, Fedor V. / Golovach, Petr A. / Sau, Ignasi / Stamoulis, Giannos / Thilikos, Dimitrios M. et al. | 2023
- 62
-
Cliques in High-Dimensional Geometric Inhomogeneous Random GraphsFriedrich, Tobias / Göbel, Andreas / Katzmann, Maximilian / Schiller, Leon et al. | 2023
- 63
-
An O(log k)-Approximation for Directed Steiner Tree in Planar GraphsFriggstad, Zachary / Mousavi, Ramin et al. | 2023
- 64
-
Parallel Self-Testing of EPR Pairs Under Computational AssumptionsFu, Honghao / Wang, Daochen / Zhao, Qi et al. | 2023
- 65
-
Matching Augmentation via Simultaneous ContractionsGarg, Mohit / Hommelsheim, Felix / Megow, Nicole et al. | 2023
- 66
-
On Differentially Private Counting on TreesGhazi, Badih / Kamath, Pritish / Kumar, Ravi / Manurangsi, Pasin / Wu, Kewen et al. | 2023
- 67
-
Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and MoreGheorghiu, Alexandru / Metger, Tony / Poremba, Alexander et al. | 2023
- 68
-
Parameterised and Fine-Grained Subgraph Counting, Modulo 2Goldberg, Leslie Ann / Roth, Marc et al. | 2023
- 69
-
Efficient Data Structures for Incremental Exact and Approximate Maximum FlowGoranci, Gramoz / Henzinger, Monika et al. | 2023
- 70
-
Low Sample Complexity Participatory BudgetingGoyal, Mohak / Sakshuwong, Sukolsak / Sarmasarkar, Sahasrajit / Goel, Ashish et al. | 2023
- 71
-
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-AssemblyHader, Daniel / Patitz, Matthew J. et al. | 2023
- 72
-
Parameter Estimation for Gibbs DistributionsHarris, David G. / Kolmogorov, Vladimir et al. | 2023
- 73
-
On Finding Constrained Independent Sets in CyclesHaviv, Ishay et al. | 2023
- 74
-
Faster Submodular Maximization for Several Classes of MatroidsHenzinger, Monika / Liu, Paul / Vondrák, Jan / Zheng, Da Wei et al. | 2023
- 75
-
Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite PlanarHliněný, Petr / Jedelský, Jan et al. | 2023
- 76
-
A Sparse Johnson-Lindenstrauss Transform Using Fast HashingHouen, Jakob Bæk Tejs / Thorup, Mikkel et al. | 2023
- 77
-
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL AlgorithmHsieh, Jun-Ting / Kothari, Pravesh K. et al. | 2023
- 78
-
Ellipsoid Fitting up to a ConstantHsieh, Jun-Ting / Kothari, Pravesh K. / Potechin, Aaron / Xu, Jeff et al. | 2023
- 79
-
Finding Almost Tight Witness TreesHyatt-Denesik, Dylan / Jabal Ameli, Afrouz / Sanità, Laura et al. | 2023
- 80
-
Efficient Caching with Reserves via MarkingIbrahimpur, Sharat / Purohit, Manish / Svitkina, Zoya / Vee, Erik / Wang, Joshua R. et al. | 2023
- 81
-
Rerouting Planar Curves and Disjoint PathsIto, Takehiro / Iwamasa, Yuni / Kakimura, Naonori / Kobayashi, Yusuke / Maezawa, Shun-ichi / Nozaki, Yuta / Okamoto, Yoshio / Ozeki, Kenta et al. | 2023
- 82
-
Hardness of Finding Combinatorial Shortest Paths on Graph AssociahedraIto, Takehiro / Kakimura, Naonori / Kamiyama, Naoyuki / Kobayashi, Yusuke / Maezawa, Shun-ichi / Nozaki, Yuta / Okamoto, Yoshio et al. | 2023
- 83
-
Searching for Regularity in Bounded FunctionsIyer, Siddharth / Whitmeyer, Michael et al. | 2023
- 84
-
Fully Dynamic Shortest Paths and Reachability in Sparse DigraphsKarczmarz, Adam / Sankowski, Piotr et al. | 2023
- 85
-
New Additive EmulatorsKogan, Shimon / Parter, Merav et al. | 2023
- 86
-
Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling ProblemsLi, Shi et al. | 2023
- 87
-
Simulating Markovian Open Quantum Systems Using Higher-Order Series ExpansionLi, Xiantao / Wang, Chunhao et al. | 2023
- 88
-
Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite MatchingLiu, S. Cliff / Song, Zhao / Zhang, Hengjie / Zhang, Lichen / Zhou, Tianyi et al. | 2023
- 89
-
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2Liu, Shu / Xing, Chaoping / Yuan, Chen et al. | 2023
- 90
-
Breaking the All Subsets Barrier for Min k-CutLokshtanov, Daniel / Saurabh, Saket / Surianarayanan, Vaishali et al. | 2023
- 91
-
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on TreesMathieu, Claire / Zhou, Hang et al. | 2023
- 92
-
Online Demand Scheduling with FailoversMellou, Konstantina / Molinaro, Marco / Zhou, Rudy et al. | 2023
- 93
-
Faster Parameterized Algorithms for Modification Problems to Minor-Closed ClassesMorelle, Laure / Sau, Ignasi / Stamoulis, Giannos / Thilikos, Dimitrios M. et al. | 2023
- 94
-
Nearly Tight Spectral Sparsification of Directed HypergraphsOko, Kazusato / Sakaue, Shinsaku / Tanigawa, Shin-ichi et al. | 2023
- 95
-
The Communication Complexity of Set Intersection Under Product DistributionsOshman, Rotem / Roth, Tal et al. | 2023
- 96
-
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed GraphsPeng, Pan / Wang, Yuyang et al. | 2023
- 97
-
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled StatesQin, Minglong / Yao, Penghui et al. | 2023
- 98
-
Scheduling Under Non-Uniform Job and Machine DelaysRajaraman, Rajmohan / Stalfa, David / Yang, Sheng et al. | 2023
- 99
-
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-RecoveryResch, Nicolas / Yuan, Chen / Zhang, Yihan et al. | 2023
- 100
-
Convergence of the Number of Period Sets in StringsRivals, Eric / Sweering, Michelle / Wang, Pengfei et al. | 2023
- 101
-
Lasserre Hierarchy for Graph Isomorphism and Homomorphism IndistinguishabilityRoberson, David E. / Seppelt, Tim et al. | 2023
- 102
-
Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction ProblemRubinstein, Ittai et al. | 2023
- 103
-
The Support of Open Versus Closed Random WalksSauerwald, Thomas / Sun, He / Vagnozzi, Danny et al. | 2023
- 104
-
Faster Matroid Partition AlgorithmsTerao, Tatsuya et al. | 2023
- 105
-
Frameworks for Nonclairvoyant Network Design with Deadlines or DelayTouitou, Noam et al. | 2023
- 106
-
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by TreewidthWłodarczyk, Michał et al. | 2023
- 107
-
The Wrong Direction of Jensen’s Inequality Is Algorithmically RightZamir, Or et al. | 2023
- 108
-
A Hyperbolic Extension of Kadison-Singer Type ResultsZhang, Ruizhe / Zhang, Xinzhi et al. | 2023
- 109
-
On Semantically-Deterministic AutomataAbu Radi, Bader / Kupferman, Orna et al. | 2023
- 110
-
Checking Refinement of Asynchronous Programs Against Context-Free SpecificationsBaumann, Pascal / Ganardi, Moses / Majumdar, Rupak / Thinniyam, Ramanathan S. / Zetzsche, Georg et al. | 2023
- 111
-
On the Limits of Decision: the Adjacent Fragment of First-Order LogicBednarczyk, Bartosz / Kojelis, Daumantas / Pratt-Hartmann, Ian et al. | 2023
- 112
-
The Complexity of Presburger Arithmetic with Power or PowersBenedikt, Michael / Chistikov, Dmitry / Mansutti, Alessio et al. | 2023
- 113
-
A Dichotomy for Succinct Representations of HomomorphismsBerkholz, Christoph / Vinall-Smeeth, Harry et al. | 2023
- 114
-
Nominal Topology for Data LanguagesBirkmann, Fabian / Milius, Stefan / Urbat, Henning et al. | 2023
- 115
-
Population Protocols with Unordered DataBlondin, Michael / Ladouceur, François et al. | 2023
- 116
-
Network Satisfaction Problems Solved by k-ConsistencyBodirsky, Manuel / Knäuer, Simon et al. | 2023
- 117
-
Algebraic Recognition of Regular FunctionsBojańczyk, Mikołaj / Nguyễn, Lê Thành Dũng (Tito) et al. | 2023
- 118
-
How to Play Optimally for Regular Objectives?Bouyer, Patricia / Fijalkow, Nathanaël / Randour, Mickael / Vandenhove, Pierre et al. | 2023
- 119
-
Monadic NIP in Monotone Classes of Relational StructuresBraunfeld, Samuel / Dawar, Anuj / Eleftheriadis, Ioannis / Papadopoulos, Aris et al. | 2023
- 120
-
Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-CalculusCarette, Titouan / Moutot, Etienne / Perez, Thomas / Vilmart, Renaud et al. | 2023
- 121
-
Deterministic Regular Functions of Infinite WordsCarton, Olivier / Douéneau-Tabot, Gaëtan / Filiot, Emmanuel / Winter, Sarah et al. | 2023
- 122
-
Characterising Memory in Infinite GamesCasares, Antonio / Ohlmann, Pierre et al. | 2023
- 123
-
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?Chakraborty, Diptarka / Chakraborty, Sourav / Kumar, Gunjan / Meel, Kuldeep S. et al. | 2023
- 124
-
The Identity Problem in ℤ ≀ ℤ Is DecidableDong, Ruiwen et al. | 2023
- 125
-
Indiscernibles and Flatness in Monadically Stable and Monadically NIP ClassesDreier, Jan / Mählmann, Nikolas / Siebertz, Sebastian / Toruńczyk, Szymon et al. | 2023
- 126
-
Black-Box Testing Liveness Properties of Partially Observable Stochastic SystemsEsparza, Javier / Grande, Vincent P. et al. | 2023
- 127
-
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product ProblemsFan, Austen Z. / Koutris, Paraschos / Zhao, Hangdong et al. | 2023
- 128
-
Flipper Games for Monadically Stable Graph ClassesGajarský, Jakub / Mählmann, Nikolas / McCarty, Rose / Ohlmann, Pierre / Pilipczuk, Michał / Przybyszewski, Wojciech / Siebertz, Sebastian / Sokołowski, Marek / Toruńczyk, Szymon et al. | 2023
- 129
-
Regular Methods for Operator Precedence LanguagesHenzinger, Thomas A. / Kebis, Pavol / Mazzocchi, Nicolas / Saraç, N. Ege et al. | 2023
- 130
-
Positivity Problems for Reversible Linear Recurrence SequencesKenison, George / Nieuwveld, Joris / Ouaknine, Joël / Worrell, James et al. | 2023
- 131
-
Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional OptimalityKünnemann, Marvin / Mazowiecki, Filip / Schütze, Lia / Sinclair-Banks, Henry / Węgrzycki, Karol et al. | 2023
- 132
-
First Order Logic on Pathwidth Revisited AgainLampis, Michael et al. | 2023
- 133
-
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with CountingLichter, Moritz et al. | 2023
- 134
-
On the Complexity of Diameter and Related Problems in Permutation GroupsLohrey, Markus / Rosowski, Andreas et al. | 2023
- 135
-
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph ClassesOhlmann, Pierre / Pilipczuk, Michał / Przybyszewski, Wojciech / Toruńczyk, Szymon et al. | 2023
- 136
-
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and ComplexityRóżowski, Wojciech / Kappé, Tobias / Kozen, Dexter / Schmid, Todd / Silva, Alexandra et al. | 2023
- 137
-
Action CodesVaandrager, Frits / Wißmann, Thorsten et al. | 2023