1 citations · 1 across the 4 of their papers we have counts for
4 papers
Memory Reallocation with Polylogarithmic Overhead
Ce Jin
The Memory Reallocation problem asks to dynamically maintain an assignment of given objects of various sizes to non-overlapping contiguous chunks of memory, while supporting update…
Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin +4
A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best…
Near-Optimal Property Testers for Pattern Matching
Ce Jin, Tomasz Kociumaka
The classic exact pattern matching problem, given two strings -- a pattern of length and a text of length -- asks whether occurs as a substring of . A proper…
New Tools for Peak Memory Scheduling
Ce Jin, Manish Purohit, Zoya Svitkina +2
We study scheduling of computation graphs to minimize peak memory consumption, an increasingly critical task due to the surge in popularity of large deep-learning models. This prob…