Ragesh Jaiswal

75 papers A* 7A 3B 4C 2Misc 2Journal 48Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	FPT approximation for capacitated sum of radii. J. Comput. Syst. Sci. Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2026	J	`jnl`	Fast CoRR Poojan Chetan Shah, Shashwat Agrawal, Ragesh Jaiswal
2026	J	`jnl`	Improved Algorithms for Clustering with Noisy Distance Oracles. CoRR Pinki Pradhan, Anup Bhattacharya, Ragesh Jaiswal
2025	J	`jnl`	A New Rejection Sampling Approach to CoRR Poojan Chetan Shah, Shashwat Agrawal, Ragesh Jaiswal
2025	J	`jnl`	Clustering What Matters in Constrained Settings. Algorithmica Ragesh Jaiswal, Amit Kumar
2025	A*	`conf`	Quantum (Inspired) D2-sampling with Applications. ICLR Poojan Chetan Shah, Ragesh Jaiswal
2025	A*	`conf`	Robust-Sorting and Applications to Ulam-Median. ICALP Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2025	J	`jnl`	Robust-Sorting and Applications to Ulam-Median. CoRR Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2024	A	`conf`	FPT Approximation for Capacitated Sum of Radii. ITCS Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2024	J	`jnl`	FPT Approximation for Capacitated Sum of Radii. CoRR Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2024	J	`jnl`	Quantum (Inspired) D CoRR Ragesh Jaiswal, Poojan Chetan Shah
2024	A*	`conf`	Universal Weak Coreset. AAAI Ragesh Jaiswal, Amit Kumar
2023	J	`jnl`	Clustering What Matters in Constrained Settings. CoRR Ragesh Jaiswal, Amit Kumar
2023	B	`conf`	Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. ISAAC Ragesh Jaiswal, Amit Kumar
2023	J	`jnl`	Tight FPT Approximation for Socially Fair Clustering. Inf. Process. Lett. Dishant Goyal, Ragesh Jaiswal
2023	J	`jnl`	Tight FPT approximation for constrained Theor. Comput. Sci. Dishant Goyal, Ragesh Jaiswal
2023	J	`jnl`	Universal Weak Coreset. CoRR Ragesh Jaiswal, Amit Kumar
2022	J	`jnl`	On the Inf. Process. Lett. Anup Bhattacharya, Yoav Freund, Ragesh Jaiswal
2021	J	`jnl`	FPT Approximation for Socially Fair Clustering. CoRR Dishant Goyal, Ragesh Jaiswal
2021	—	`conf`	Hardness of Approximation for Euclidean k-Median. APPROX-RANDOM Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal
2021	J	`jnl`	Tight FPT Approximation for Constrained k-Center and k-Supplier. CoRR Dishant Goyal, Ragesh Jaiswal
2020	J	`jnl`	A note on the relation between XOR and Selective XOR lemmas. Inf. Process. Lett. Ragesh Jaiswal
2020	B	`conf`	FPT Approximation for Constrained Metric k-Median/Means. IPEC Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020	J	`jnl`	FPT Approximation for Constrained Metric k-Median/Means. CoRR Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020	J	`jnl`	Hardness of Approximation of Euclidean k-Median. CoRR Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal
2020	—	`conf`	Multiplicative Rank-1 Approximation using Length-Squared Sampling. SOSA Ragesh Jaiswal, Amit Kumar
2020	—	`conf`	On Sampling Based Algorithms for k-Means. FSTTCS Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2019	J	`jnl`	A note on the relation between XOR and Selective XOR Lemmas. Electron. Colloquium Comput. Complex. Ragesh Jaiswal
2019	J	`jnl`	Multiplicative Rank-1 Approximation using Length-Squared Sampling. CoRR Ragesh Jaiswal, Amit Kumar
2019	J	`jnl`	Streaming PTAS for Binary 𝓁 CoRR Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2019	J	`jnl`	Streaming PTAS for Constrained k-Means. CoRR Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2018	A	`conf`	Approximate Clustering with Same-Cluster Queries. ITCS Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2018	—	`ch.`	Approximate Clustering. Handbook of Approximation Algorithms and Metaheuristics (2) Ragesh Jaiswal, Sandeep Sen
2018	B	`conf`	Approximate Correlation Clustering Using Same-Cluster Queries. LATIN Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
2018	J	`jnl`	Faster Algorithms for the Constrained k-means Problem. Theory Comput. Syst. Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2018	J	`jnl`	Sampling in Space Restricted Settings. Algorithmica Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2017	J	`jnl`	Approximate Clustering with Same-Cluster Queries. CoRR Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2017	J	`jnl`	Approximate Correlation Clustering Using Same-Cluster Queries. CoRR Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
2017	J	`jnl`	On the k-Means/Median Cost Function. CoRR Anup Bhattacharya, Ragesh Jaiswal
2016	A	`conf`	Faster Algorithms for the Constrained k-Means Problem. STACS Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2016	—	`conf`	Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
2016	J	`jnl`	Simultaneous Secrecy and Reliability Amplification for a General Channel Model. IACR Cryptol. ePrint Arch. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
2016	J	`jnl`	Tight lower bound instances for k-means++ in two dimensions. Theor. Comput. Sci. Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2015	J	`jnl`	Faster Algorithms for the Constrained k-means Problem. CoRR Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2015	J	`jnl`	Improved analysis of D Inf. Process. Lett. Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav
2015	J	`jnl`	Noise Stable Halfspaces are Close to Very Small Juntas. Chic. J. Theor. Comput. Sci. Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2015	Misc	`conf`	Sampling in Space Restricted Settings. COCOON Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2015	J	`jnl`	k-Means++ under approximation stability. Theor. Comput. Sci. Manu Agarwal, Ragesh Jaiswal, Arindam Pal
2014	J	`jnl`	A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2014	C	`conf`	A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2014	J	`jnl`	A tight lower bound instance for k-means++ in constant dimension. CoRR Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2014	J	`jnl`	Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems. CoRR Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav
2014	J	`jnl`	On Uniform Reductions between Direct Product and XOR Lemmas. CoRR Ragesh Jaiswal
2014	J	`jnl`	Sampling in Space Restricted Settings. CoRR Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2013	J	`jnl`	A bad 2-dimensional instance for k-means++. CoRR Ragesh Jaiswal, Prachi Jain, Saumya Yadav
2013	C	`conf`	k-means++ under Approximation Stability. TAMC Manu Agarwal, Ragesh Jaiswal, Arindam Pal
2012	Misc	`conf`	A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	J	`jnl`	A simple D^2-sampling based PTAS for k-means and other Clustering Problems CoRR Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	—	`conf`	Analysis of k-Means++ for Separable Data. APPROX-RANDOM Ragesh Jaiswal, Nitin Garg
2012	—	`conf`	Congestion lower bounds for secure in-network aggregation. WISEC Raghav Bhaskar, Ragesh Jaiswal, Sidharth Telang
2012	J	`jnl`	On the Distribution of the Fourier Spectrum of Halfspaces CoRR Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2010	J	`jnl`	Bounded Independence Fools Halfspaces. SIAM J. Comput. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2010	J	`jnl`	Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson
2009	J	`jnl`	Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. SIAM J. Comput. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
2009	J	`jnl`	Bounded Independence Fools Halfspaces CoRR Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	A*	`conf`	Bounded Independence Fools Halfspaces. FOCS Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	J	`jnl`	Bounded Independence Fools Halfspaces. Electron. Colloquium Comput. Complex. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	J	`jnl`	Chernoff-Type Direct Product Theorems. J. Cryptol. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
2009	B	`conf`	Security Amplification for InteractiveCryptographic Primitives. TCC Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
2009	—	`conf`	Streaming k-means approximation. NIPS Nir Ailon, Ragesh Jaiswal, Claire Monteleoni
2008	—	`—`	New proofs of (new) Direct Product Theorems. Ragesh Jaiswal
2008	J	`jnl`	Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson
2008	A*	`conf`	Uniform direct product theorems: simplified, optimized, and derandomized. STOC Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson
2007	A*	`conf`	Chernoff-Type Direct Product Theorems. CRYPTO Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
2006	A*	`conf`	Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.