![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
S. V. Nagaraj
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]Deepali Bankatsingh Gothawal
, S. V. Nagaraj:
An intelligent and lightweight intrusion detection mechanism for RPL routing attacks by applying automata model. Inf. Secur. J. A Glob. Perspect. 32(1): 1-20 (2023) - [j22]S. V. Nagaraj:
Review of Programming for the Puzzled: Learn to Program While Solving Puzzles Srini Devadas. SIGACT News 54(1): 18-21 (2023) - 2021
- [j21]S. V. Nagaraj:
Review of Network Flow Algorithms David P. Williamson. SIGACT News 52(1): 12-15 (2021) - [j20]S. V. Nagaraj:
Review of The Age of Algorithms by Serge Abiteboul and Gilles Dowek. SIGACT News 52(4): 15-17 (2021) - [j19]Dhanashri Narayan Wategaonkar
, S. V. Nagaraj
, T. R. Reshmi
:
Multi-hop Energy-Efficient Reliable Cluster-based Sectoring Scheme Using Markov Chain Model to Improve QoS Parameters in a WSN. Wirel. Pers. Commun. 119(1): 393-421 (2021) - 2020
- [j18]S. V. Nagaraj:
Review of Market Design: A Linear Programming Approach to Auctions and Matching. SIGACT News 51(2): 11-14 (2020) - [j17]Deepali Bankatsingh Gothawal
, S. V. Nagaraj
:
Anomaly-Based Intrusion Detection System in RPL by Applying Stochastic and Evolutionary Game Models over IoT Environment. Wirel. Pers. Commun. 110(3): 1323-1344 (2020)
2010 – 2019
- 2019
- [j16]S. V. Nagaraj:
Review of Codes, Cryptology and Curves with Computer Algebra. SIGACT News 50(1): 14-16 (2019) - 2018
- [j15]S. V. Nagaraj:
Review of Trends in Computational Social Choice Edited by Ulle Endriss. SIGACT News 49(2): 14-17 (2018) - [j14]S. V. Nagaraj:
Review of Power Up: : Unlocking the hidden mathematics in video games. SIGACT News 49(3): 14-19 (2018) - 2017
- [j13]S. V. Nagaraj:
Review of Algebraic Coding Theory Revised Edition by Elwyn Berlekamp. SIGACT News 48(1): 23-26 (2017) - [j12]S. V. Nagaraj:
Review of Handbook of Computational Social Choice Edited by Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia. SIGACT News 48(4): 13-17 (2017) - 2016
- [j11]S. V. Nagaraj:
Review of: Mathematics Everywhere by Martin Aigner and Ehrhard Behrends (Eds.). SIGACT News 47(3): 22-24 (2016) - 2015
- [j10]S. V. Nagaraj:
Review of: A Mathematical Orchard - Problems and Solutions by Mark Krusemeyer, George Gilbert, and Loren Larson. SIGACT News 46(3): 21-22 (2015) - [j9]S. V. Nagaraj:
Review of: Handbook of Finite Fields by Gary L. Mullen and Daniel Panario. SIGACT News 46(4): 17-18 (2015) - 2014
- [j8]S. V. Nagaraj:
Review of integrated methods for optimization second edition, 2012 by John Hooker. SIGACT News 45(2): 30-32 (2014) - 2013
- [j7]S. V. Nagaraj:
Review of P, NP, and NP-Completeness by Oded Goldreich. SIGACT News 44(1): 10-11 (2013) - [j6]S. V. Nagaraj:
Review of history of mathematics: highways and byways by Amy Dahan-Dalmedico and Jeanne Peiffer. SIGACT News 44(4): 27-28 (2013) - 2012
- [c3]S. V. Nagaraj
:
Securing Multi-agent Systems: A Survey. ACITY (1) 2012: 23-30
2000 – 2009
- 2008
- [j5]Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj
:
Divisors in residue classes, constructively. Math. Comput. 77(261): 531-545 (2008) - 2004
- [j4]S. V. Nagaraj
:
Book Review: Managing Gigabytes: Compressing and Indexing documents and images - By Ian H. Witten, Alistair Moffat, and Timothy C. Bell (Second Edition). SIGMOD Rec. 33(2): 113-114 (2004) - [i1]Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj:
Divisors in Residue Classes, Constructively. IACR Cryptol. ePrint Arch. 2004: 339 (2004) - 2001
- [c2]S. V. Nagaraj
:
Access Control in Distributed Object Systems: Problems With Access Control Lists. WETICE 2001: 163-164
1990 – 1999
- 1997
- [j3]R. Balasubramanian, S. V. Nagaraj:
Density of Carmichael numbers with three prime factors. Math. Comput. 66(220): 1705-1708 (1997) - [j2]S. V. Nagaraj
:
Optimal Binary Search Trees. Theor. Comput. Sci. 188(1-2): 1-44 (1997) - [c1]R. Balasubramanian, S. V. Nagaraj:
The Least Witness of a Composite Number. ISW 1997: 66-74 - 1996
- [j1]R. Balasubramanian, S. V. Nagaraj
:
Perfect Power Testing. Inf. Process. Lett. 58(2): 59-63 (1996)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 22: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