default search action
S. Arunkumar
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- S. Arunkumar 0001 — Indian Institute of Technology Bombay, Department of Computer Science and Engineering, Mumbai, India
- S. Arunkumar 0002 — Institute of Engineering and Management, Department of Information Technology, Calcutta, India
- S. Arunkumar 0003 — PSNA College of Engineering and Technology, Department of Electronics and Communication Engineering, Dindigul, India
- S. Arun-Kumar 0004 (aka: S. Arunkumar 0004) — Indian Institute of Technology Delhi, Department of Computer Science and Engineering, India
- S. Arunkumar 0005 (aka: Arunkumar Sukumar) — SASTRA Deemed University, School of Computing, Thanjavur, India
- S. Arunkumar 0006 (aka: Arunkumar Subramanian 0001) — Nehru Institute of Engineering and Technology, Coimbatore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Ranjeeth Kumar Sundararajan, Ganesh Jayaraman, S. Arunkumar, M. Jeyapandian, Kalaivani Kaliyaperumal, Deepan Perumal, V. R. Sarma Dhulipala:
EECAS: Energy Efficient Clustering and Aggregator Node Selection for Wireless Sensor Networks. Wirel. Pers. Commun. 136(2): 899-919 (2024) - 2022
- [c19]S. Arun-Kumar:
Extending Process Algebra with an Undefined Action. TASE 2022: 173-179
2010 – 2019
- 2019
- [c18]S. Sasikala, M. Bharathi, M. Ezhilarasi, S. Arunkumar:
Breast Cancer Detection Based on Medio-Lateral ObliqueView and Cranio-Caudal View Mammograms: An Overview. iCAST 2019: 1-6 - 2016
- [c17]Mangala Gowri Nanda, S. Arun-Kumar:
Decompiling Boolean Expressions from Java™ Bytecode. ISEC 2016: 59-69 - 2015
- [j5]V. Kannan, S. Arunkumar, Muniyandi Venkatesan:
Artificial neural network-based temperature prediction in heat sinks with cross cuts fins. Int. J. Adv. Intell. Paradigms 7(3/4): 292-301 (2015) - [c16]S. Arunkumar, S. Baalachandar, R. Dayanidhi, Karthie S., Suresh R. Norman:
Microcontroller based Tabla tuning system. ICCE 2015: 566-568 - 2013
- [c15]Manish Gaur, S. Arun-Kumar:
On Efficiency Preorders. FSEN 2013: 83-94
2000 – 2009
- 2006
- [c14]S. Arun-Kumar:
On Bisimilarities Induced by Relations on Actions. SEFM 2006: 41-49 - [e1]S. Arun-Kumar, Naveen Garg:
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4337, Springer 2006, ISBN 3-540-49994-6 [contents] - 2005
- [c13]Astrid Kiehn, S. Arun-Kumar:
Amortised Bisimulations. FORTE 2005: 320-334 - [c12]M. Jamshid Bagherzadeh, S. Arun-Kumar:
Flexible Communication of Agents based on FIPA-ACL. FSEN 2005: 23-39 - 2004
- [c11]Neelesh Korade, S. Arun-Kumar:
A Logical Characterization of Efficiency Preorders. ICTAC 2004: 99-112 - [c10]M. Jamshid Bagherzadeh, S. Arun-Kumar:
A Multi-agent Framework Based on Communication and Concurrency. IWDC 2004: 114-125 - [c9]M. Jamshid Bagherzadeh, S. Arun-Kumar:
Layered Clausal Resolution in the Multi-modal Logic of Beliefs and Goals. LPAR 2004: 544-559 - 2003
- [c8]Pramod Kumar Meher, Thambipillai Srikanthan, M. Mahesh Kumar, S. Arunkumar:
Low-Power Transform-Domain Coding by Separable Two-Dimensional Hartley-Like Transform. Embedded Systems and Applications 2003: 228-236 - 2002
- [p1]Sanjiva Prasad, S. Arun-Kumar:
Introduction to Operational Semantics. The Compiler Design Handbook 2002: 841-890 - 2000
- [c7]Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar:
Reflecting BDDs in Coq. ASIAN 2000: 162-181
1990 – 1999
- 1996
- [c6]Kamal Jain, S. Arun-Kumar:
Testing Processes for Efficiency. FSTTCS 1996: 100-110 - 1995
- [c5]S. Arun-Kumar, V. Natarajan:
Conformance: A Precongruence close to Bisimilarity. STRICT 1995: 55-68 - 1992
- [j4]S. Arun-Kumar, Matthew Hennessy:
An Efficiency Preorder for Processes. Acta Informatica 29(8): 737-760 (1992) - [c4]S. Arunkumar, R. S. Panwar:
Efficient Broadcast Using Selective Flooding. INFOCOM 1992: 2060-2067 - 1991
- [c3]S. Arun-Kumar, Matthew Hennessy:
An Efficiency Preorder for Processes. TACS 1991: 152-175
1980 – 1989
- 1988
- [j3]Ron Koymans, R. K. Shyamasundar, Willem P. de Roever, Rob Gerth, S. Arun-Kumar:
Compositional Semantics for Real-Time Distributed Computing. Inf. Comput. 79(3): 210-256 (1988) - 1986
- [c2]S. R. Goregaokar, S. Arun-Kumar:
A Characterization of Asynchronous Message-Passing. FSTTCS 1986: 270-287 - 1985
- [j2]K. Rangarajan, S. Arun-Kumar:
Fair Derivations in E0L Systems. Inf. Process. Lett. 20(4): 183-188 (1985) - [c1]Ron Koymans, R. K. Shyamasundar, Willem P. de Roever, Rob Gerth, S. Arun-Kumar:
Compositional Semantics for Real-time Distributed Computing. Logic of Programs 1985: 167-189
1970 – 1979
- 1978
- [j1]S. Arunkumar, K. Chon:
On Optimal Regulation Policies for Certain Multi-Reservoir Systems. Oper. Res. 26(4): 551-562 (1978)
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-12-02 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint