default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAsim K. Pal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i4]Mitodru Niyogi, Asim K. Pal:
Discovering conversational topics and emotions associated with Demonetization tweets in India. CoRR abs/1711.04115 (2017)- 2016
- [c13]Asim K. Pal, Subrata Bose, Arpita Maitra:
Collaborative Information Service - Privacy Algebra for User Defined Security. ICISSP 2016: 473-481 - 2015
- [i3]Arpita Maitra, Sourya Joyee De, Goutam Paul, Asim K. Pal:
A Proposal for Quantum Rational Secret Sharing. CoRR abs/1501.04212 (2015) - [i2]Arpita Maitra, Goutam Paul, Asim K. Pal:
Millionaires' Problem with Rational Players: a Unified Approach in Classical and Quantum Paradigms. CoRR abs/1504.01974 (2015) - [i1]Arpita Maitra, Goutam Paul, Asim K. Pal:
Fairness in Secure Two-Party Computation with Rational Players. IACR Cryptol. ePrint Arch. 2015: 1071 (2015) - 2014
- [c12]Sourya Joyee De, Sushmita Ruj
, Asim K. Pal:
Should Silence be Heard? Fair Rational Secret Sharing with Silent and Non-silent Players. CANS 2014: 240-255 - [c11]Sourya Joyee De, Asim K. Pal:
A Policy-Based Security Framework for Storage and Computation on Enterprise Data in the Cloud. HICSS 2014: 4986-4997 - 2013
- [c10]Sourya Joyee De, Asim K. Pal:
Cloud-Based Privacy Aware Preference Aggregation Service. CD-ARES 2013: 208-223 - [c9]Sourya Joyee De, Asim K. Pal:
Achieving Correctness in Fair Rational Secret Sharing. CANS 2013: 139-161 - [c8]Sourya Joyee De, Sourav Saha, Asim K. Pal:
Achieving Energy Efficiency and Security in Mobile Cloud Computing. CLOSER 2013: 469-474 - [c7]Sourya Joyee De, Asim K. Pal:
Auctions with Rational Adversary. ICISS 2013: 91-105 - 2011
- [j2]Tarun Bhaskar, Manabendra N. Pal, Asim K. Pal:
A heuristic method for RCPSP with fuzzy activity times. Eur. J. Oper. Res. 208(1): 57-66 (2011)
2000 – 2009
- 2007
- [c6]Ramasubramanian Sundararajan, Asim K. Pal:
Rejection schemes for graded multiclass problems. Artificial Intelligence and Applications 2007: 434-439 - 2005
- [c5]Satish K. Sehgal, Asim K. Pal:
Privacy Preserving Decentralized Method for Computing a Pareto-Optimal Solution. IWDC 2005: 578-583 - 2004
- [c4]Ramasubramanian Sundararajan, Asim K. Pal:
Learning with an Embedded Reject Option: A Statistical Learning Theory Perspective. ICAISC 2004: 664-669 - [c3]Satish K. Sehgal, Asim K. Pal:
Finding Pareto-Optimal Set of Distributed Vectors with Minimum Disclosure. IWDC 2004: 144-149
1990 – 1999
- 1997
- [j1]Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal:
On the Asymptotic Performance of IDA*. Ann. Math. Artif. Intell. 20(1-4): 161-193 (1997) - 1992
- [c2]Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal:
Performance of IDA on Trees and Graphs. AAAI 1992: 539-544
1980 – 1989
- 1984
- [c1]Asim K. Pal, A. Bagchi:
On the Mean Weight Balance Factor of Binary Trees. FSTTCS 1984: 419-434
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-04-25 05:54 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:
