23 citations · 65 across the 8 of their papers we have counts for
8 papers
EvoFlint: An Evolutionary Atlas of Multi-Turn LLM Vulnerabilities
Feitong Qiao, Liren Peng, Shiming Ren +7
Frontier language models that refuse harmful single-turn prompts often comply when the same intent is reached gradually over many turns, making multi-turn attacks one of the least…
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we part…
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
A significant amount of recent research work has addressed the problem of solving various data management problems in the cloud. The major algorithmic challenges in map-reduce comp…
Finding Connected Components on Map-reduce in Logarithmic Rounds
Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis +1
Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fu…
CBLOCK: An Automatic Blocking Mechanism for Large-Scale De-duplication Tasks
Anish Das Sarma, Ankur Jain, Ashwin Machanavajjhala +1
De-duplication---identification of distinct records referring to the same real-world entity---is a well-known challenge in data integration. Since very large datasets prohibit the…
Understanding Fashion Cycles as a Social Choice
Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy +1
We present a formal model for studying fashion trends, in terms of three parameters of fashionable items: (1) their innate utility; (2) individual boredom associated with repeated…
PROBER: Ad-Hoc Debugging of Extraction and Integration Pipelines
Anish Das Sarma, Alpa Jain, Philip Bohannon
Complex information extraction (IE) pipelines assembled by plumbing together off-the-shelf operators, specially customized operators, and operators re-used from other text processi…
Succinct Coverage Oracles
Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi
In this paper, we identify a fundamental algorithmic problem that we term succinct dynamic covering (SDC), arising in many modern-day web applications, including ad-serving and onl…