The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "SODA"( http://dblp.L3S.de/Venues/SODA )

URL (DBLP): http://dblp.uni-trier.de/db/conf/soda

Publication years (Num. hits)
1990 (55) 1991 (54) 1992 (55) 1993 (56) 1994 (80) 1995 (71) 1996 (66) 1997 (86) 1998 (80) 1999 (168) 2000 (127) 2001 (129) 2002 (130) 2003 (116) 2004 (139) 2005 (138) 2006 (137) 2007 (140) 2008 (139) 2009 (139) 2010 (136) 2011 (137) 2012 (140) 2013 (136) 2014 (137) 2015 (137) 2016 (148) 2017 (183) 2018 (182) 2019 (185) 2020 (183) 2021 (182) 2022 (149) 2023 (191) 2024 (193)
Publication types (Num. hits)
inproceedings(4489) proceedings(35)
Venues (Conferences, Journals, ...)
SODA(4524)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 167 occurrences of 134 keywords

Results
Found 4524 publication records. Showing 4524 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier Revenue Maximization for Buyers with Costly Participation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rajat De, Dominik Kempa Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan 0001 Code Sparsification and its Applications. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vasilis Livanos, Ruta Mehta Minimization is Harder in the Prophet World. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak 0001 On Dynamic Graph Algorithms with Predictions. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann The Time Complexity of Fully Sparse Matrix Multiplication. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis Smoothed Complexity of SWAP in Local Graph Partitioning. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi Arborescences, Colorful Forests, and Popularity. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Christopher Trevisan Sorting and Selection in Rounds with Adversarial Comparisons. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Will Perkins 0001, Yuzhou Wang On the hardness of finding balanced independent sets in random bipartite graphs. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yu Chen 0039, Zihan Tan On (1 + ɛ)-Approximate Flow Sparsifiers. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zhongtian He, Shang-En Huang, Thatchaphol Saranurak Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Ruiquan Gao Improved Approximations for Ultrametric Violation Distance. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Itay Safran, Daniel Reichman 0001, Paul Valiant How Many Neurons Does it Take to Approximate the Maximum? Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Abhishek Dhawan Edge-Coloring Algorithms for Bounded Degree Multigraphs. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan Higher-Order Cheeger Inequality for Partitioning with Buffers. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Adam Karczmarz Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zhongtian He, Shang-En Huang, Thatchaphol Saranurak Cactus Representation of Minimum Cuts: Derandomize and Speed up. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Arpit Agarwal, Sanjeev Khanna, Huan Li 0002, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov Tree Containment Above Minimum Degree is FPT. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Barna Saha, Christopher Ye Faster Approximate All Pairs Shortest Paths. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Simina Brânzei, Davin Choo, Nicholas J. Recker The Sharp Power Law of Local Search on Expanders. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou Dynamic Dictionary with Subconstant Wasted Bits per Key. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Gregory Kehne, Roie Levin Set Covering with Our Eyes Wide Shut. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Anish Hebbar, Arindam Khan 0001, K. V. N. Sreenivas Bin Packing under Random-Order: Breaking the Barrier of 3/2. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lap Chi Lau, Kam Chuen Tung, Robert Wang 0004 Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Pingan Cheng, Da Wei Zheng An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Cameron Musco, Kshiteej Sheth Sublinear Time Low-Rank Approximation of Toeplitz Matrices. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ariel D. Procaccia, Isaac Robinson, Jamie Tucker-Foltz School Redistricting: Wiping Unfairness Off the Map. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak 0001 Parameterized algorithms for block-structured integer programs with large entries. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1David Rasmussen Lolck, Rasmus Pagh Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh Dynamic Algorithms for Matroid Submodular Maximization. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Michael Kapralov, Erik Waingarten A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood The Grid-Minor Theorem Revisited. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros Learning Hard-Constrained Models with One Sample. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Christian Konrad 0001, Kheeran K. Naidu An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Songsong Li, Chaoping Xing Fast Fourier transform via automorphism groups of rational function fields. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Guru Guruganesh, Aranyak Mehta, Di Wang 0005, Kangning Wang Prior-Independent Auctions for Heterogeneous Bidders. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Julia Gaudio, Xiaochun Niu, Ermin Wei Exact Community Recovery in the Geometric SBM. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shiri Ron Impossibilities for Obviously Strategy-Proof Mechanisms. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Arun Jambulapati, Victor Reis, Kevin Tian Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Fatima Elsheimy, Giorgos Tsimos, Charalampos Papamanthou Deterministic Byzantine Agreement with Adaptive O(n · f) Communication. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Natan Rubin Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vishesh Jain, Huy Tuan Pham Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Tomohiro Koana, Magnus Wahlström Determinantal Sieving. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sumegha Garg, Christopher Jung 0001, Omer Reingold, Aaron Roth 0001 Oracle Efficient Online Multicalibration and Omniprediction. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Magnus Wahlström Representative set statements for delta-matroids and the Mader delta-matroid. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Moni Naor, Eugene Pekel Adjacency Sketches in Adversarial Environments. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Daniel Gibney, Ce Jin 0001, Tomasz Kociumaka, Sharma V. Thankachan Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Joshua Brakensiek, Neng Huang, Uri Zwick Tight approximability of MAX 2-SAT and relatives, under UGC. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi 2-Approximation for Prize-Collecting Steiner Forest. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nick Fischer Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tuukka Korhonen, Daniel Lokshtanov Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Gorav Jindal On the Hardness of PosSLP. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ruoxu Cen, William He, Jason Li 0006, Debmalya Panigrahi Beyond the Quadratic Time Barrier for Network Unreliability. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Siu-Wing Cheng, Haoqiang Huang Solving Fréchet Distance Problems by Algebraic Geometric Methods. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dor Minzer, Kai Zhe Zheng Adversarial Low Degree Testing. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vít Jelínek, Michal Opler, Jakub Pekárek The Hierarchy of Hereditary Sorting Operators. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Adam Karczmarz, Wojciech Nadara, Marek Sokolowski 0001 Exact Shortest Paths with Rational Weights on the Word RAM. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi 0001 A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pankaj K. Agarwal, Esther Ezra, Micha Sharir Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Victor Y. Pan Nearly Optimal Black Box Polynomial Root-finders. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kent Quanrud Faster exact and approximation algorithms for packing and covering matroids via push-relabel. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost Dynamically Maintaining the Persistent Homology of Time Series. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Omar Alrabiah, Venkatesan Guruswami, Ray Li AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ainesh Bakshi, Ewin Tang An Improved Classical Singular Value Transformation for Quantum Machine Learning. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sébastien Collette, John Iacono Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Hung Le 0001, Christian Wulff-Nilsen VC Set Systems in Minor-free (Di)Graphs and Applications. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl Najafian Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Raphael A. Meyer, Cameron Musco, Christopher Musco On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Haotian Jiang, Yin Tat Lee, Zhao Song 0002, Lichen Zhang 0003 Convex Minimization with Integer Minima in Õ(n4) Time. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter Santa Claus meets Makespan and Matroids: Algorithms and Reductions. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn Adaptive Out-Orientations with Applications. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xin Lyu 0002, Hongxun Wu, Junzhao Yang The Cost of Parallelizing Boosting. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dmitriy Kunisky Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zongchen Chen, Yuzhou Gu Fast Sampling of b-Matchings and b-Edge Covers. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vera Traub, Laura Vargas Koch, Rico Zenklusen Single-Source Unsplittable Flows in Planar Graphs. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii Controlling Tail Risk in Online Ski-Rental. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Chien-Chung Huang, François Sellier Robust Sparsification for Matroid Intersection with Applications. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak Cliquewidth and Dimension. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Max Gläser, Marc E. Pfetsch Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Alaa Ibrahim, Bruno Salvy Positivity Certificates for Linear Recurrences. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Greg Bodwin, Bernhard Haeupler, Merav Parter Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Maxime Flin, Mohsen Ghaffari 0001, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin A Distributed Palette Sparsification Theorem. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Evangelos Kosinas Computing the 5-Edge-Connected Components in Linear Time. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shuchi Chawla 0001, Kristin Sheridan Composition of nested embeddings with an application to outlier removal. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jingcheng Liu 0005, Jalaj Upadhyay, Zongrui Zou Optimal Bounds on Private Graph Approximation. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Louis Golowich New Explicit Constant-Degree Lossless Expanders. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Anindya De, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Anupam Gupta 0001, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar Maintaining Matroid Intersections Online. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski Power of Posted-price Mechanisms for Prophet Inequalities. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski Sparse induced subgraphs in P6-free graphs. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla 0001, Yifan Wang Bandit Algorithms for Prophet Inequality and Pandora's Box. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 4524 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license