• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 32 matches

• 2023
• 
  Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
  Bias Reduction for Sum Estimation. APPROX/RANDOM 2023: 62:1-62:21
• 
  Christian Janos Lebeda, Jakub Tetek:
  Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. PODS 2023: 79-88
• 
  Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
  A Nearly Tight Analysis of Greedy k-means++. SODA 2023: 1012-1070
• 
  Jacob Holm, Jakub Tetek:
  Massively Parallel Computation on Embedded Planar Graphs. SODA 2023: 4373-4408
• 
  Talya Eden, Shyam Narayanan, Jakub Tetek:
  Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA 2023: 253-260
• 
  Shyam Narayanan, Jakub Tetek:
  Estimating the Effective Support Size in Constant Query Complexity. SOSA 2023: 242-252
• 
  Christian Janos Lebeda, Jakub Tetek:
  Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. CoRR abs/2301.02457 (2023)
• 2022
• 
  Jakub Tetek:
  Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. ICALP 2022: 107:1-107:20
• 
  Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
  ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. SC 2022: 43:1-43:17
• 
  Lorenzo Beretta, Jakub Tetek:
  Better Sum Estimation via Weighted Sampling. SODA 2022: 2303-2338
• 
  Jakub Tetek, Mikkel Thorup:
  Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC 2022: 1116-1129
• 
  Jacob Holm, Jakub Tetek:
  Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. CoRR abs/2204.09035 (2022)
• 
  Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
  A Nearly Tight Analysis of Greedy k-means++. CoRR abs/2207.07949 (2022)
• 
  Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
  Bias Reduction for Sum Estimation. CoRR abs/2208.01197 (2022)
• 
  Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
  ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. CoRR abs/2208.11469 (2022)
• 
  Jakub Tetek:
  Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private. CoRR abs/2211.03695 (2022)
• 
  Talya Eden, Shyam Narayanan, Jakub Tetek:
  Sampling an Edge in Sublinear Time Exactly and Optimally. CoRR abs/2211.04981 (2022)
• 
  Shyam Narayanan, Jakub Tetek:
  Estimating the Effective Support Size in Constant Query Complexity. CoRR abs/2211.11344 (2022)
• 2021
• 
  Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
  Performance of Bounded-Rational Agents With the Ability to Self-Modify. SafeAI@AAAI 2021
• 
  Kasper Green Larsen, Rasmus Pagh, Jakub Tetek:
  CountSketches, Feature Hashing and the Median of Three. ICML 2021: 6011-6020
• 
  Kasper Green Larsen, Rasmus Pagh, Jakub Tetek:
  CountSketches, Feature Hashing and the Median of Three. CoRR abs/2102.02193 (2021)
• 
  Jakub Tetek:
  Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. CoRR abs/2104.08501 (2021)
• 
  Jakub Tetek, Mikkel Thorup:
  Sampling and Counting Edges via Vertex Accesses. CoRR abs/2107.03821 (2021)
• 
  Lorenzo Beretta, Jakub Tetek:
  Better Sum Estimation via Weighted Sampling. CoRR abs/2110.14948 (2021)
• 2020
• 
  Jakub Tetek:
  Sampling an Edge Uniformly in Sublinear Time. CoRR abs/2009.11178 (2020)
• 
  Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
  Performance of Bounded-Rational Agents With the Ability to Self-Modify. CoRR abs/2011.06275 (2020)
• 2019
• 
  Tomas Gavenciak, Jakub Tetek:
  Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. TAMC 2019: 222-241
• 
  Martin Hora, Václav Koncický, Jakub Tetek:
  Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators. TAMC 2019: 295-312
• 2018
• 
  Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer:
  On the Simultaneous Minimum Spanning Trees Problem. CALDAM 2018: 235-248
• 
  Martin Hora, Václav Koncický, Jakub Tetek:
  Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators. CoRR abs/1807.03611 (2018)

skipping 2 more matches