default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilind Kulkarni 0001
Person information
- affiliation: Purdue University, West Lafayette, USA
Other persons with the same name
- Milind Kulkarni 0002 — Vishwakarma Institute of Technology
- Milind Kulkarni 0003 — Philips Research India, Bangalore, India
- Milind Kulkarni 0004 — Cisco Systems Inc., San Jose, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j16]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset (Artifact). Dagstuhl Artifacts Ser. 10(2): 21:1-21:10 (2024)- [j15]Zengxiang Lei
, Jiawei Xue, Xiaowei Chen, Xinwu Qian, Charitha Saumya, Mingyi He, Stanislav Sobolevsky, Milind Kulkarni, Satish V. Ukkusuri:
METS-R SIM: A simulator for Multi-modal Energy-optimal Trip Scheduling in Real-time with shared autonomous electric vehicles. Simul. Model. Pract. Theory 132: 102898 (2024) - [j14]Vidush Singhal, Laith Sakka, Kirshanthan Sundararajah, Ryan Newton, Milind Kulkarni:
Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals. ACM Trans. Archit. Code Optim. 21(2): 41 (2024) - [c78]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms {+} Data Layouts {=} Efficient Programs. ECOOP 2024: 38:1-38:28 - [c77]Durga Keerthi Mandarapu, Vani Nagarajan, Artem Pelenitsyn, Milind Kulkarni:
Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing. ICS 2024: 14-25 - [c76]Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, Ryan R. Newton:
Garbage Collection for Mostly Serialized Heaps. ISMM 2024: 1-14 - [i19]Durga Keerthi Mandarapu, Nicholas James, Milind Kulkarni:
Mochi: Fast \& Exact Collision Detection. CoRR abs/2402.14801 (2024) - [i18]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset. CoRR abs/2405.17590 (2024) - [i17]Pratyush Das, Adhitha Dias, Anxhelo Xhebraj, Artem Pelenitsyn, Kirshanthan Sundararajah, Milind Kulkarni:
SABLE: Staging Blocked Evaluation of Sparse Matrix Computations. CoRR abs/2407.00829 (2024) - 2023
- [c75]Raghav Malik, Kabir Sheth, Milind Kulkarni:
Coyote: A Compiler for Vectorizing Encrypted Arithmetic Circuits. ASPLOS (3) 2023: 118-133 - [c74]Rodrigo C. O. Rocha, Charitha Saumya, Kirshanthan Sundararajah, Pavlos Petoumenos, Milind Kulkarni, Michael F. P. O'Boyle:
HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction. CC 2023: 156-167 - [c73]Vani Nagarajan, Durga Mandarapu, Milind Kulkarni:
RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search. ICS 2023: 289-300 - [c72]Vani Nagarajan, Milind Kulkarni:
RT-DBSCAN: Accelerating DBSCAN using Ray Tracing Hardware. IPDPS 2023: 963-973 - [c71]Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni, Roopsha Samanta:
Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification. TACAS (2) 2023: 289-308 - [e3]Maryam Mehri Dehnavi, Milind Kulkarni, Sriram Krishnamoorthy:
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023, Montreal, QC, Canada, 25 February 2023 - 1 March 2023. ACM 2023, ISBN 979-8-4007-0015-6 [contents] - [i16]Vani Nagarajan, Milind Kulkarni:
RT-DBSCAN: Accelerating DBSCAN using Ray Tracing Hardware. CoRR abs/2303.09655 (2023) - [i15]Vani Nagarajan, Durga Mandarapu, Milind Kulkarni:
RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search. CoRR abs/2305.18356 (2023) - [i14]Charitha Saumya, Rohan Gangaraju, Kirshanthan Sundararajah, Milind Kulkarni:
Targeted Control-flow Transformations for Mitigating Path Explosion in Dynamic Symbolic Execution. CoRR abs/2308.01554 (2023) - [i13]Durga Mandarapu, Vani Nagarajan, Milind Kulkarni:
Generalized Neighbor Search using Commodity Hardware Acceleration. CoRR abs/2311.09168 (2023) - [i12]Adhitha Dias, Logan Anderson, Kirshanthan Sundararajah, Artem Pelenitsyn, Milind Kulkarni:
SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring. CoRR abs/2311.09549 (2023) - 2022
- [j13]Christopher Wright, William A. Moeglein, Saurabh Bagchi, Milind Kulkarni, Abraham A. Clements:
Challenges in Firmware Re-Hosting, Emulation, and Analysis. ACM Comput. Surv. 54(1): 5:1-5:36 (2022) - [j12]Kirshanthan Sundararajah, Charitha Saumya, Milind Kulkarni:
UniRec: a unimodular-like framework for nested recursions and loops. Proc. ACM Program. Lang. 6(OOPSLA2): 1264-1290 (2022) - [c70]Charitha Saumya, Kirshanthan Sundararajah, Milind Kulkarni:
DARM: Control-Flow Melding for SIMT Thread Divergence Reduction. CGO 2022: 1-13 - [c69]Adhitha Dias, Kirshanthan Sundararajah, Charitha Saumya, Milind Kulkarni:
SparseLNR: accelerating sparse tensor computations using loop nest restructuring. ICS 2022: 15:1-15:14 - [c68]Vidush Singhal, Akul Abhilash Pillai, Charitha Saumya, Milind Kulkarni, Aravind Machiry:
Cornucopia : A Framework for Feedback Guided Generation of Binaries. ASE 2022: 27:1-27:13 - [i11]Adhitha Dias, Kirshanthan Sundararajah, Charitha Saumya, Milind Kulkarni:
SparseLNR: Accelerating Sparse Tensor Computations Using Loop Nest Restructuring. CoRR abs/2205.11622 (2022) - [i10]Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni, Roopsha Samanta:
Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Parameterized Verification. CoRR abs/2208.12400 (2022) - [i9]Vidush Singhal, Akul Abhilash Pillai, Charitha Saumya, Milind Kulkarni, Aravind Machiry:
Cornucopia: A Framework for Feedback Guided Generation of Binaries. CoRR abs/2209.06694 (2022) - 2021
- [j11]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient tree-traversals: reconciling parallelism and dense data representations. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [j10]Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni, Roopsha Samanta:
QuickSilver: modeling and parameterized verification for distributed agreement-based systems. Proc. ACM Program. Lang. 5(OOPSLA): 1-31 (2021) - [c67]Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: metaprogramming for secure multi-party computation. GPCE 2021: 130-143 - [c66]Raghav Malik, Vidush Singhal, Benjamin Gottfried, Milind Kulkarni:
Vectorized secure evaluation of decision forests. PLDI 2021: 1049-1063 - [i8]Raghav Malik, Vidush Singhal, Benjamin Gottfried, Milind Kulkarni:
Vectorized Secure Evaluation of Decision Forests. CoRR abs/2104.09583 (2021) - [i7]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations. CoRR abs/2107.00522 (2021) - [i6]Charitha Saumya, Kirshanthan Sundararajah, Milind Kulkarni:
CFM: SIMT Thread Divergence Reduction by Melding Similar Control-Flow Regions in GPGPU Programs. CoRR abs/2107.05681 (2021) - 2020
- [j9]Saurabh Bagchi, Vaneet Aggarwal, Somali Chaterji, Fred Douglis, Aly El Gamal, Jiawei Han, Brian J. Henz, Henry Hoffmann, Suman Jana, Milind Kulkarni, Felix Xiaozhu Lin, Karen B. Marais, Prateek Mittal, Shaoshuai Mou, Xiaokang Qiu, Gesualdo Scutari:
Vision Paper: Grand Challenges in Resilience: Autonomous System Resilience through Design and Runtime Measures. IEEE Open J. Comput. Soc. 1: 155-172 (2020) - [c65]Nouraldin Jaber, Swen Jacobs, Christopher Wagner, Milind Kulkarni, Roopsha Samanta:
Parameterized Verification of Systems with Global Synchronization and Guards. CAV (1) 2020: 299-323 - [i5]Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni, Roopsha Samanta:
Parameterized Reasoning for Distributed Systems with Consensus. CoRR abs/2004.04613 (2020) - [i4]Nouraldin Jaber, Swen Jacobs, Christopher Wagner, Milind Kulkarni, Roopsha Samanta:
Parameterized Verification of Systems with Global Synchronization and Guards. CoRR abs/2004.04896 (2020) - [i3]Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: An Ecosystem for Building Secure Multi-Party Computations. CoRR abs/2009.01489 (2020)
2010 – 2019
- 2019
- [j8]Hemant Gehlot, Xianyuan Zhan, Xinwu Qian, Christopher Thompson, Milind Kulkarni, Satish V. Ukkusuri:
A-RESCUE 2.0: A High-Fidelity, Parallel, Agent-Based Evacuation Simulator. J. Comput. Civ. Eng. 33(2) (2019) - [j7]Robert Utterback, Kunal Agrawal, I-Ting Angelina Lee, Milind Kulkarni:
Processor-Oblivious Record and Replay. ACM Trans. Parallel Comput. 6(4): 20:1-20:28 (2019) - [j6]Bin Ren, Shruthi Balakrishna, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni:
Extracting SIMD Parallelism from Recursive Task-Parallel Programs. ACM Trans. Parallel Comput. 6(4): 24:1-24:37 (2019) - [c64]Christopher Wright, Sriram Krishnamoorthy, Milind Kulkarni:
MULKSG: MULtiple K Simultaneous Graph Assembly. AlCoB 2019: 125-136 - [c63]Jianqiao Liu, Michael P. Robson, Thomas Quinn, Milind Kulkarni:
Efficient GPU tree walks for effective distributed n-body simulations. ICS 2019: 24-34 - [c62]Charitha Saumya, Jinkyu Koo, Milind Kulkarni, Saurabh Bagchi:
XSTRESSOR : Automatic Generation of Large-Scale Worst-Case Test Inputs by Inferring Path Conditions. ICST 2019: 1-12 - [c61]Jinkyu Koo, Charitha Saumya, Milind Kulkarni, Saurabh Bagchi:
PySE: Automatic Worst-Case Test Generation by Reinforcement Learning. ICST 2019: 136-147 - [c60]Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni, Ryan R. Newton:
LoCal: a language for programs operating on serialized data. PLDI 2019: 48-62 - [c59]Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, Milind Kulkarni:
Sound, fine-grained traversal fusion for heterogeneous trees. PLDI 2019: 830-844 - [c58]Kirshanthan Sundararajah, Milind Kulkarni:
Composable, sound transformations of nested recursion and loops. PLDI 2019: 902-917 - [c57]Nikhil Hegde, Qifan Chang, Milind Kulkarni:
D2P: from recursive formulations to distributed-memory codes. SC 2019: 22:1-22:22 - [e2]José Nelson Amaral, Milind Kulkarni:
Proceedings of the 28th International Conference on Compiler Construction, CC 2019, Washington, DC, USA, February 16-17, 2019. ACM 2019, ISBN 978-1-4503-6277-1 [contents] - [i2]Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, Milind Kulkarni:
Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version. CoRR abs/1904.07061 (2019) - [i1]Saurabh Bagchi, Vaneet Aggarwal, Somali Chaterji, Fred Douglis, Aly El Gamal, Jiawei Han, Brian J. Henz, Hank Hoffmann, Suman Jana, Milind Kulkarni, Felix Xiaozhu Lin, Karen B. Marais, Prateek Mittal, Shaoshuai Mou, Xiaokang Qiu, Gesualdo Scutari:
Grand Challenges of Resilience: Autonomous System Resilience through Design and Runtime Measures. CoRR abs/1912.11598 (2019) - 2017
- [j5]Laith Sakka, Kirshanthan Sundararajah, Milind Kulkarni:
TreeFuser: a framework for analyzing and fusing general recursive tree traversals. Proc. ACM Program. Lang. 1(OOPSLA): 76:1-76:30 (2017) - [c56]Kirshanthan Sundararajah, Laith Sakka, Milind Kulkarni:
Locality Transformations for Nested Recursive Iteration Spaces. ASPLOS 2017: 281-295 - [c55]Kanak Mahadik, Christopher Wright, Milind Kulkarni, Saurabh Bagchi, Somali Chaterji:
Scalable Genomic Assembly through Parallel de Bruijn Graph Construction for Multiple K-mers. BCB 2017: 425-431 - [c54]Nouraldin Jaber, Milind Kulkarni:
Data structure-aware heap partitioning. CC 2017: 109-119 - [c53]Aritra Sengupta, Man Cao, Michael D. Bond, Milind Kulkarni:
Legato: end-to-end bounded region serializability using commodity hardware transactional memory. CGO 2017: 1-13 - [c52]Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, Ryan Newton:
Compiling Tree Transforms to Operate on Packed Representations. ECOOP 2017: 26:1-26:29 - [c51]Nitin, Mithuna Thottethodi, T. N. Vijaykumar, Milind Kulkarni:
Efficient Collaborative Approximation in MapReduce without Missing Rare Keys. ICCAC 2017: 80-91 - [c50]Nikhil Hegde, Jianqiao Liu, Milind Kulkarni:
SPIRIT: a framework for creating distributed recursive tree applications. ICS 2017: 3:1-3:11 - [c49]Nikhil Hegde, Jianqiao Liu, Kirshanthan Sundararajah, Milind Kulkarni:
Treelogy: A benchmark suite for tree traversals. ISPASS 2017: 227-238 - [c48]Bin Ren, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni:
Exploiting Vector and Multicore Parallelism for Recursive, Data- and Task-Parallel Programs. PPoPP 2017: 117-130 - [c47]Robert Utterback, Kunal Agrawal, I-Ting Angelina Lee, Milind Kulkarni:
Processor-Oblivious Record and Replay. PPoPP 2017: 145-161 - 2016
- [c46]Jianqiao Liu, Nikhil Hegde, Milind Kulkarni:
Hybrid CPU-GPU scheduling and execution of tree traversals. ICS 2016: 2:1-2:12 - [c45]Kanak Mahadik, Christopher Wright, Jinyi Zhang, Milind Kulkarni, Saurabh Bagchi, Somali Chaterji:
SARVAVID: A Domain Specific Language for Developing Scalable Computational Genomics Applications. ICS 2016: 34:1-34:12 - [c44]Nikhil Hegde, Jianqiao Liu, Milind Kulkarni:
Treelogy: a benchmark suite for tree traversal applications. IISWC 2016: 227-228 - [c43]Jad Hbeika, Milind Kulkarni:
Locality-Aware Task-Parallel Execution on GPUs. LCPC 2016: 250-264 - [c42]Chenyang Liu, Milind Kulkarni:
Evaluating Performance of Task and Data Coarsening in Concurrent Collections. LCPC 2016: 331-345 - [c41]Jianqiao Liu, Nikhil Hegde, Milind Kulkarni:
Hybrid CPU-GPU scheduling and execution of tree traversals. PPoPP 2016: 41:1-41:2 - [c40]Nikhil Hegde, Jianqiao Liu, Milind Kulkarni:
SPIRIT: a runtime system for distributed irregular tree applications. PPoPP 2016: 51:1-51:2 - 2015
- [j4]Ignacio Laguna, Dong H. Ahn, Bronis R. de Supinski, Todd Gamblin, Gregory L. Lee, Martin Schulz, Saurabh Bagchi, Milind Kulkarni, Bowen Zhou, Zhezhe Chen, Feng Qin:
Debugging high-performance computing applications at massive scales. Commun. ACM 58(9): 72-81 (2015) - [c39]Aritra Sengupta, Swarnendu Biswas, Minjia Zhang, Michael D. Bond, Milind Kulkarni:
Hybrid Static: Dynamic Analysis for Statically Bounded Region Serializability. ASPLOS 2015: 561-575 - [c38]Milind Kulkarni, Yung-Hsiang Lu:
Beyond Big Data - Rethinking Programming Languages for Non-persistent Data. CCBD 2015: 245-251 - [c37]Nabeel AlSaber, Milind Kulkarni:
SemCache++: Semantics-Aware Caching for Efficient Multi-GPU Offloading. ICS 2015: 79-88 - [c36]Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu, Milind Kulkarni:
Tree dependence analysis. PLDI 2015: 314-325 - [c35]Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni:
Efficient execution of recursive programs on commodity vector hardware. PLDI 2015: 509-520 - [c34]Nabeel AlSaber, Milind Kulkarni:
SemCache++: semantics-aware caching for efficient multi-GPU offloading. PPoPP 2015: 255-256 - [c33]Aritra Sengupta, Man Cao, Michael D. Bond, Milind Kulkarni:
Toward Efficient Strong Memory Model Support for the Java Platform via Hybrid Synchronization. PPPJ 2015: 65-75 - [c32]Michael D. Bond, Milind Kulkarni, Man Cao, Meisam Fathi Salmi, Jipeng Huang:
Efficient Deterministic Replay of Multithreaded Executions in a Managed Language Virtual Machine. PPPJ 2015: 90-101 - [c31]Chenyang Liu, Milind Kulkarni:
Optimizing the LULESH stencil code using concurrent collections. WOLFHPC@SC 2015: 5:1-5:10 - 2014
- [c30]Kanak Mahadik, Somali Chaterji, Bowen Zhou, Milind Kulkarni, Saurabh Bagchi:
Orion: Scaling Genomic Sequence Matching with Fine-Grained Parallelization. SC 2014: 449-460 - [e1]Jeremy Singer, Milind Kulkarni, Tim Harris:
Proceedings of the workshop on Memory Systems Performance and Correctness, MSPC '14, Edinburgh, United Kingdom, June 13, 2014. ACM 2014, ISBN 978-1-4503-2917-0 [contents] - 2013
- [c29]Youngjoon Jo, Michael Goldfarb, Milind Kulkarni:
Automatic vectorization of tree traversals. PACT 2013: 363-374 - [c28]Wei-Chiu Chuang, Bo Sang, Sunghwan Yoo, Rui Gu, Milind Kulkarni, Charles Edwin Killian:
EventWave: programming model and runtime support for tightly-coupled elastic cloud applications. SoCC 2013: 21:1-21:16 - [c27]Bowen Zhou, Jonathan Too, Milind Kulkarni, Saurabh Bagchi:
WuKong: automatically detecting and localizing bugs that manifest at large system scales. HPDC 2013: 131-142 - [c26]Chenyang Liu, Muhammad Hasan Jamal, Milind Kulkarni, Arun Prakash, Vijay S. Pai:
Exploiting domain knowledge to optimize parallel computational mechanics codes. ICS 2013: 25-36 - [c25]Nabeel AlSaber, Milind Kulkarni:
SemCache: semantics-aware caching for efficient GPU offloading. ICS 2013: 421-432 - [c24]Michael D. Bond, Milind Kulkarni, Man Cao, Minjia Zhang, Meisam Fathi Salmi, Swarnendu Biswas, Aritra Sengupta, Jipeng Huang:
OCTET: capturing and controlling cross-thread dependences efficiently. OOPSLA 2013: 693-712 - [c23]Bowen Zhou, Milind Kulkarni, Saurabh Bagchi:
WuKong: effective diagnosis of bugs at large system scales. PPoPP 2013: 317-318 - [c22]Michael Goldfarb, Youngjoon Jo, Milind Kulkarni:
General transformations for GPU execution of tree traversals. SC 2013: 10:1-10:12 - 2012
- [c21]Wei-Chiu Chuang, Bo Sang, Charles Edwin Killian, Milind Kulkarni:
Programming Model Support for Dependable, Elastic Cloud Applications. HotDep 2012 - [c20]Bowen Zhou, Milind Kulkarni, Saurabh Bagchi:
ABHRANTA: Locating Bugs that Manifest at Large System Scales. HotDep 2012 - [c19]Youngjoon Jo, Milind Kulkarni:
Automatically enhancing locality for tree traversals with traversal splicing. OOPSLA 2012: 355-374 - 2011
- [c18]Kanad Sinha, Milind Kulkarni:
Techniques for Fine-Grained, Multi-site Computation Offloading. CCGRID 2011: 184-194 - [c17]Bowen Zhou, Milind Kulkarni, Saurabh Bagchi:
Vrisha: using scaling properties of parallel programs for bug detection and localization. HPDC 2011: 85-96 - [c16]Sunghwan Yoo, Hyojeong Lee, Charles Edwin Killian, Milind Kulkarni:
InContext: simple parallelism for distributed applications. HPDC 2011: 97-108 - [c15]Mohammad Sajjad Hossain, A. B. M. Alim Al Islam, Milind Kulkarni, Vijay Raghunathan:
μSETL: A set based programming abstraction for wireless sensor networks. IPSN 2011: 354-365 - [c14]Youngjoon Jo, Milind Kulkarni:
Enhancing locality for recursive traversals of recursive structures. OOPSLA 2011: 463-482 - [c13]Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui:
The tao of parallelism in algorithms. PLDI 2011: 12-25 - [c12]Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Keshav Pingali:
Exploiting the commutativity lattice. PLDI 2011: 542-555 - [c11]Youngjoon Jo, Milind Kulkarni:
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms. SPAA 2011: 263-264 - 2010
- [j3]Milind Kulkarni, Vijay S. Pai, Derek L. Schuff:
Towards architecture independent metrics for multicore performance analysis. SIGMETRICS Perform. Evaluation Rev. 38(3): 10-14 (2010) - [c10]Derek L. Schuff, Milind Kulkarni, Vijay S. Pai:
Accelerating multicore reuse distance analysis with sampling and parallelization. PACT 2010: 53-64 - [c9]Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Muhammad Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali:
Structure-driven optimizations for amorphous data-parallel programs. PPoPP 2010: 3-14 - [c8]Youngjoon Jo, Milind Kulkarni:
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications. SPAA 2010: 183-185
2000 – 2009
- 2009
- [j2]Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew:
Optimistic parallelism requires abstractions. Commun. ACM 52(9): 89-97 (2009) - [c7]Milind Kulkarni, Martin Burtscher, Calin Cascaval, Keshav Pingali:
Lonestar: A suite of parallel irregular programs. ISPASS 2009: 65-76 - [c6]Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, Calin Cascaval:
How much parallelism is there in irregular applications? PPoPP 2009: 3-14 - 2008
- [b1]Milind Kulkarni:
The Galois System: Optimistic Parallelization of Irregular Programs. Cornell University, USA, 2008 - [j1]Milind Kulkarni, Keshav Pingali:
An Experimental Study of Self-Optimizing Dense Linear Algebra Software. Proc. IEEE 96(5): 832-848 (2008) - [c5]Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew:
Optimistic parallelism benefits from data partitioning. ASPLOS 2008: 233-243 - [c4]Martin Burtscher, Milind Kulkarni, Dimitrios Prountzos, Keshav Pingali:
On the Scalability of an Automatically Parallelized Irregular Application. LCPC 2008: 109-123 - [c3]Milind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew:
Scheduling strategies for optimistic parallel execution of irregular programs. SPAA 2008: 217-228 - 2007
- [c2]Milind Kulkarni, Keshav Pingali:
Scheduling Issues in Optimistic Parallelization. IPDPS 2007: 1-7 - [c1]Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew:
Optimistic parallelism requires abstractions. PLDI 2007: 211-222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
