default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGunjan Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Gunjan Kumar
, Jyoti Prakash Singh, Amit Kumar Singh:
Autoencoder-Based Feature Extraction for Identifying Hate Speech Spreaders in Social Media. IEEE Trans. Comput. Soc. Syst. 11(4): 4819-4827 (2024)- [c15]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. AISTATS 2024: 3592-3600 - [c14]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. SODA 2024: 4371-4394 - [i12]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Equivalence Testing: The Power of Bounded Adaptivity. CoRR abs/2403.04230 (2024) - 2023
- [c13]Archana Kumari, Archana Garge, Priyanshu Raj, Gunjan Kumar, Jyoti Prakash Singh, Mohammad Alryalat:
Classification of Offensive Tweet in Marathi Language Using Machine Learning Models. CICBA (1) 2023: 261-273 - [c12]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? ICALP 2023: 123:1-123:17 - [c11]Diptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Support Size Estimation: The Power of Conditioning. MFCS 2023: 33:1-33:13 - [i11]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle? CoRR abs/2306.10281 (2023) - [i10]Gunjan Kumar, Kuldeep S. Meel, Yash Pote:
Tolerant Testing of High-Dimensional Samplers with Subcube Conditioning. CoRR abs/2308.04264 (2023) - [i9]Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar:
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. CoRR abs/2308.11558 (2023) - 2022
- [c10]Gunjan Kumar, Jyoti Prakash Singh:
Hate Speech and Offensive Content Identification in English and Indo-Aryan Languages using Machine Learning Models. FIRE (Working Notes) 2022: 542-551 - [c9]Abishek Thangamuthu, Gunjan Kumar, Suresh Bishnoi, Ravinder Bhattoo, N. M. Anoop Krishnan, Sayan Ranu:
Unravelling the Performance of Physics-informed Graph Neural Networks for Dynamical Systems. NeurIPS 2022 - [i8]Abishek Thangamuthu, Gunjan Kumar, Suresh Bishnoi, Ravinder Bhattoo, N. M. Anoop Krishnan, Sayan Ranu:
Unravelling the Performance of Physics-informed Graph Neural Networks for Dynamical Systems. CoRR abs/2211.05520 (2022) - [i7]Diptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Support Size Estimation: The Power of Conditioning. CoRR abs/2211.11967 (2022) - 2021
- [j3]Gunjan Kumar, Houssem Jerbi, Michael P. O'Mahony:
A sequence-based and context modelling framework for recommendation. Expert Syst. Appl. 175: 114665 (2021) - [c8]Gunjan Kumar, Jyoti Prakash Singh, Abhinav Kumar:
A Deep Multi-modal Neural Network for the Identification of Hate Speech from Social Media. I3E 2021: 670-680 - [c7]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. ISAAC 2021: 51:1-51:16 - [i6]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. CoRR abs/2107.07800 (2021) - 2020
- [c6]Umang Bhaskar, Gunjan Kumar:
A Non-Extendibility Certificate for Submodularity and Applications. COCOON 2020: 603-614 - [c5]Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. ISAAC 2020: 46:1-46:16 - [c4]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. SODA 2020: 2758-2769
2010 – 2019
- 2019
- [c3]Umang Bhaskar, Gunjan Kumar:
The Complexity of Partial Function Extension for Coverage Functions. APPROX-RANDOM 2019: 30:1-30:21 - [i5]Umang Bhaskar, Gunjan Kumar:
The Complexity of Partial Function Extension for Coverage Functions. CoRR abs/1907.07230 (2019) - [i4]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. CoRR abs/1909.13345 (2019) - 2018
- [i3]Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. CoRR abs/1812.05821 (2018) - 2017
- [c2]Gunjan Kumar, Houssem Jerbi, Michael P. O'Mahony:
Towards the Recommendation of Personalised Activity Sequences in the Tourism Domain. RecTour@RecSys 2017: 26-30 - 2015
- [j2]Gunjan Kumar, Saswata Shannigrahi:
New online algorithm for dynamic speed scaling with sleep state. Theor. Comput. Sci. 593: 79-87 (2015) - [j1]Gunjan Kumar, Saswata Shannigrahi:
On the NP-hardness of speed scaling with sleep state. Theor. Comput. Sci. 600: 1-10 (2015) - 2014
- [c1]Gunjan Kumar, Houssem Jerbi, Cathal Gurrin, Michael P. O'Mahony:
Towards Activity Recommendation from Lifelogs. iiWAS 2014: 87-96 - 2013
- [i2]Gunjan Kumar, Saswata Shannigrahi:
New Online Algorithm for Dynamic Speed Scaling with Sleep State. CoRR abs/1303.0377 (2013) - [i1]Gunjan Kumar, Saswata Shannigrahi:
NP-Hardness of Speed Scaling with a Sleep State. CoRR abs/1304.7373 (2013)
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-09-10 01:16 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:
