No. Title Author Year
1 A Brief History of History-Determinism (Invited Talk) Lehtinen, Karoliina 2023
2 A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems Henzinger, Monika et al. 2023
3 A Connectivity-Sensitive Approach to Consensus Dynamics Chazelle, Bernard et al. 2023
4 A Curry-Howard Correspondence for Linear, Reversible Computation Chardonnet, Kostia et al. 2023
5 A Cyclic Proof System for Full Computation Tree Logic Afshari, Bahareh et al. 2023
6 A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators Attias, Idan et al. 2023
7 A Generalization of the Persistent Laplacian to Simplicial Maps Gülen, Aziz Burak et al. 2023
8 A Lattice-Theoretical View of Strategy Iteration Baldan, Paolo et al. 2023
9 A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary Albouy, Timothé et al. 2023
10 A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems Chuzhoy, Julia et al. 2023
11 A Normalized Edit Distance on Infinite Words Fisman, Dana et al. 2023
12 A Positive Perspective on Term Representation (Invited Talk) Miller, Dale et al. 2023
13 A Privacy-Preserving and Transparent Certification System for Digital Credentials Saramago, Rodrigo Q. et al. 2023
14 A Regular and Complete Notion of Delay for Streaming String Transducers Filiot, Emmanuel et al. 2023
15 A Researcher’s Digest of GQL (Invited Talk) Francis, Nadime et al. 2023
16 A Simple Algorithm for Consistent Query Answering Under Primary Keys Figueira, Diego et al. 2023
17 A Simply Numbered Lambda Calculus Steimann, Friedrich 2023
18 A Structural Approach to Tree Decompositions of Knots and Spatial Graphs Lunel, Corentin et al. 2023
19 A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit Fawzi, Hamza et al. 2023
20 A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility Castenow, Jannik et al. 2023
21 Absolute Expressiveness of Subgraph-Based Centrality Measures Pieris, Andreas et al. 2023
22 Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications Papadopoulou, Evanthia 2023
23 Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks Oh, Shunhao et al. 2023
24 Adding Transitivity and Counting to the Fluted Fragment Pratt-Hartmann, Ian et al. 2023
25 Adjacent LSTM-Based Page Scheduling for Hybrid DRAM/NVM Memory Systems Katsaragakis, Manolis et al. 2023
26 Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371) Bläser, Markus et al. 2023
27 Algorithmic Aspects of Information Theory (Dagstuhl Seminar 22301) Kolaitis, Phokion G. et al. 2023
28 Algorithms for Length Spectra of Combinatorial Tori Delecroix, Vincent et al. 2023
29 Algorithms for Participatory Democracy (Dagstuhl Seminar 22271) Brill, Markus et al. 2023
30 Algorithms with More Granular Differential Privacy Guarantees Ghazi, Badih et al. 2023
31 All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method Assadi, Sepehr et al. 2023
32 Amortised Analysis of Dynamic Data Structures (Invited Talk) Rotenberg, Eva 2023
33 An Algebraic Approach to Vectorial Programs Paperman, Charles et al. 2023
34 An Algorithmic Approach to Address Course Enrollment Challenges Biswas, Arpita et al. 2023
35 An Algorithmic Bridge Between Hamming and Levenshtein Distances Goldenberg, Elazar et al. 2023
36 An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees Dufay, Marc et al. 2023
37 An Evaluation of the State-Of-The-Art Software and Hardware Implementations of BIKE Galimberti, Andrea et al. 2023
38 An Extension Theorem for Signotopes Bergold, Helena et al. 2023
39 An Improved Lower Bound for Matroid Intersection Prophet Inequalities Saxena, Raghuvansh R. et al. 2023
40 An Optimal Algorithm for Sliding Window Order Statistics Raykov, Pavel 2023
41 An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance Li, Haohong et al. 2023
42 Analysing the SML97 Definition: Lexicalisation Scott, Elizabeth et al. 2023
43 Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals Amanatidis, Georgios et al. 2023
44 Approximate Selection with Unreliable Comparisons in Optimal Expected Time Huang, Shengyu et al. 2023
45 Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width Bergé, Pierre et al. 2023
46 Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries Figueira, Diego et al. 2023
47 Asymptotic Rewriting (Invited Talk) Faggian, Claudia 2023
48 Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks El-Hayek, Antoine et al. 2023
49 Asynchronous Multi-Party Quantum Computation Goyal, Vipul et al. 2023
50 Avoidance Games Are PSPACE-Complete Gledel, Valentin et al. 2023
51 Barriers for Faster Dimensionality Reduction Nova Fandina, Ora et al. 2023
52 Beeping Shortest Paths via Hypergraph Bipartite Decomposition Dufoulon, Fabien et al. 2023
53 Beyond the Threaded Programming Model on Real-Time Operating Systems Jellum, Erling Rennemo et al. 2023
54 Beyond Worst-Case Budget-Feasible Mechanism Design Rubinstein, Aviad et al. 2023
55 Bidding Strategies for Proportional Representation in Advertisement Campaigns Navon, Inbal Livni et al. 2023
56 Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization Dey, Papri et al. 2023
57 Black-Box Constructive Proofs Are Unavoidable Chen, Lijie et al. 2023
58 Bond Percolation in Small-World Graphs with Power-Law Distribution Becchetti, Luca et al. 2023
59 Bootstrapping Homomorphic Encryption via Functional Encryption Bitansky, Nir et al. 2023
60 Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence Gaitonde, Jason et al. 2023
61 ByteNite: A New Business Model for Grid Computing (Invited Paper) Caironi, Fabio et al. 2023
62 Certificate Games Chakraborty, Sourav et al. 2023
63 Certification with an NP Oracle Blanc, Guy et al. 2023
64 Challenges and Opportunities in C/C++ Source-To-Source Compilation (Invited Paper) Bispo, João et al. 2023
65 Challenges and Opportunities of Democracy in the Digital Society (Dagstuhl Seminar 22361) Bernstein, Abraham et al. 2023
66 Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly Kol, Gillat et al. 2023
67 Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks Rozen-Schiff, Neta et al. 2023
68 Clustering Permutations: New Techniques with Streaming Applications Chakraborty, Diptarka et al. 2023
69 Cognitive Augmentation (Dagstuhl Seminar 22491) Kunze, Kai et al. 2023
70 Cognitive Robotics (Dagstuhl Seminar 22391) Heintz, Fredrik et al. 2023
71 Combinatorial Depth Measures for Hyperplane Arrangements Schnider, Patrick et al. 2023
72 Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4 Gorbachev, Egor et al. 2023
73 Communication Complexity of Inner Product in Symmetric Normed Spaces Andoni, Alexandr et al. 2023
74 Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption Yandamuri, Sravya et al. 2023
75 Compact Data Structures Meet Databases (Invited Talk) Navarro, Gonzalo 2023
76 Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes Hu, Lunjia et al. 2023
77 Comparing Bottom-Up with Top-Down Parsing Architectures for the Syntax Definition Formalism from a Disambiguation Standpoint Vinju, Jurgen J. 2023
78 Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation Vilmart, Renaud 2023
79 Complexity Classifications via Algebraic Logic Jaakkola, Reijo et al. 2023
80 Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines Ani, Joshua et al. 2023
81 Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability Jaakkola, Reijo 2023
82 Complexity of the Temporal Shortest Path Interdiction Problem Boeckmann, Jan et al. 2023
83 Computational Approaches to Digitised Historical Newspapers (Dagstuhl Seminar 22292) Ehrmann, Maud et al. 2023
84 Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs Inoue, Taichi et al. 2023
85 Computational Social Dynamics (Dagstuhl Seminar 22452) Hoefer, Martin et al. 2023
86 Computer Science Methods for Effective and Sustainable Simulation Studies (Dagstuhl Seminar 22401) Cai, Wentong et al. 2023
87 Computing a Dirichlet Domain for a Hyperbolic Surface Despré, Vincent et al. 2023
88 Computing Instance-Optimal Kernels in Two Dimensions Agarwal, Pankaj K. et al. 2023
89 Computing Power of Hybrid Models in Synchronous Networks Fraigniaud, Pierre et al. 2023
90 Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time Brunelli, Filippo et al. 2023
91 Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations Anshu, Anurag et al. 2023
92 Conf Researchr: A Domain-Specific Content Management System for Managing Large Conference Websites Groenewegen, Danny M. et al. 2023
93 Conjunctive Queries with Free Access Patterns Under Updates Kara, Ahmet et al. 2023
94 Consensus Division in an Arbitrary Ratio Goldberg, Paul et al. 2023
95 Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting Amezian El Khalfioui, Aziz et al. 2023
96 Constant-Delay Enumeration for SLP-Compressed Documents Muñoz, Martín et al. 2023
97 Constant-Depth Sorting Networks Dobrokhotova-Maikova, Natalia et al. 2023
98 Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size Chan, Timothy M. et al. 2023
99 Constructing Concise Convex Covers via Clique Covers (CG Challenge) Abrahamsen, Mikkel et al. 2023
100 Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq Forster, Yannick et al. 2023
Current Page :
Number of result pages: 170
Number of documents: 16935

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI