default search action
D. Sivakumar
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
- D. Sivakumar 0001 — Google Inc., Mountain View, CA, USA (and 3 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Hussain Azath
, M. Devi Mani, G. K. D. Prasanna Venkatesan, D. Sivakumar, J. P. Ananth
Identification of IoT Device From Network Traffic Using Artificial Intelligence Based Capsule Networks. Wirel. Pers. Commun. 123(3): 2227-2243 (2022)
2010 – 2019
- 2019
- [j10]C. SriVenkateswaran, D. Sivakumar:
Secure cluster-based data aggregation in wireless sensor networks with aid of ECC. Int. J. Bus. Inf. Syst. 31(2): 153-169 (2019) - 2018
- [j9]B. Suseela, D. Sivakumar:
Certain investigations on effective rate adaptation in cognitive radio with channel characteristics. Int. J. Netw. Virtual Organisations 19(2/3/4): 373-384 (2018) - 2013
- [j8]M. Manohar, Jomy Joseph
Application of desirability-function and RSM to optimise the multi-objectives while turning Inconel 718 using coated carbide tools. Int. J. Manuf. Technol. Manag. 27(4/5/6): 218-237 (2013) - [j7]V. Kalaichelvi
Analysis of gas metal arc welding process using GA tuned fuzzy rule based system. J. Intell. Fuzzy Syst. 25(2): 429-440 (2013) - 2011
- [c19]Rohan Seth, Michele Covell, Deepak Ravichandran, D. Sivakumar, Shumeet Baluja:
A Tale of Two (Similar) Cities - Inferring City Similarity through Geo-spatial Query Log Analysis. KDIR 2011: 179-189 - 2010
- [j6]D. Rathikarani, D. Sivakumar
Design of an optimal PI controller for a non-linear process using genetic algorithm. Int. J. Autom. Control. 4(4): 480-503 (2010)
2000 – 2009
- 2009
- [c18]Shumeet Baluja, Deepak Ravichandran, D. Sivakumar:
Text Classification through Time - Efficient Label Propagation in Time-Based Graphs. KDIR 2009: 174-182 - 2008
- [c17]D. Rathikarani, D. Sivakumar
Identification and Control of Air flow Process. ICIIS 2008: 1-6 - [c16]Govindarajan Yamuna, D. Sivakumar
Secured and Lossless Watermarking Technique for Patent Infringement. ITNG 2008: 1295-1296 - [c15]Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar, Deepak Ravichandran, Mohamed Aly:
Video suggestion and discovery for youtube: taking random walks through the view graph. WWW 2008: 895-904 - 2002
- [c14]D. Sivakumar:
Algorithmic Derandomization via Complexity Theory. CCC 2002: 10 - [c13]D. Sivakumar:
Algorithmic derandomization via complexity theory. STOC 2002: 619-626 - 2000
- [j5]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30(2): 576-601 (2000) - [j4]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theor. Comput. Sci. 240(2): 257-269 (2000)
1990 – 1999
- 1999
- [j3]Jin-yi Cai, D. Sivakumar:
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. J. Comput. Syst. Sci. 58(2): 280-296 (1999) - [j2]D. Sivakumar:
On Membership Comparable Sets. J. Comput. Syst. Sci. 59(2): 270-280 (1999) - [c12]Jin-yi Cai, Aduri Pavan, D. Sivakumar:
On the Hardness of Permanent. STACS 1999: 90-99 - [c11]Jin-yi Cai, Ajay Nerurkar, D. Sivakumar:
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735 - 1998
- [c10]D. Sivakumar:
On Membership Comparable Sets. CCC 1998: 2-7 - [c9]Kenneth W. Regan, D. Sivakumar:
Probabilistic Martingales and BPTIME Classes. CCC 1998: 186- - [c8]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS 1998: 161-171 - [i2]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar:
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c7]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997: 62-71 - [c6]Jin-yi Cai, D. Sivakumar, Martin Strauss:
Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604 - 1996
- [c5]Jin-yi Cai, Ashish V. Naik, D. Sivakumar:
On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318 - 1995
- [j1]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995) - [c4]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995: 26-35 - [c3]Jin-yi Cai, D. Sivakumar:
The Resolution of a Hartmanis Conjecture. FOCS 1995: 362-371 - [c2]Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar:
Communication Complexity of Key Agreement on Small Ranges. STACS 1995: 38-49 - [i1]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c1]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
Quasilinear Time Complexity Theory. STACS 1994: 97-108
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-08-17 23:41 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: