Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Cyber Security in India [[electronic resource] ] : Education, Research and Training / / edited by Sandeep Kumar Shukla, Manindra Agrawal
| Cyber Security in India [[electronic resource] ] : Education, Research and Training / / edited by Sandeep Kumar Shukla, Manindra Agrawal |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 108 p. 81 illus., 54 illus. in color.) |
| Disciplina | 005.8 |
| Collana | IITK Directions |
| Soggetto topico |
Engineering—Vocational guidance
Computer security Electrical engineering Data structures (Computer science) Technical education Job Careers in Science and Engineering Systems and Data Security Communications Engineering, Networks Data Structures and Information Theory Engineering/Technology Education |
| ISBN | 981-15-1675-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Foreword – Gulshan Rai, National Cyber Security Coordinator, Government of India -- 2. Preface – Sandeep K. Shukla and Manindra Agrawal, IIT Kanpur -- 3. Critical Infrastructure Security and Defense in the 21st Century -- Sandeep K. Shukla, IIT Kanpur -- 4. Cryptology and Mathematical Attacks on Cryptographic Algorithms – Manindra Agrawal, IIT Kanpur -- 5. SCADA Lab for Cyber Security Research and Education – Rohit Negi, IIT Kanpur -- 6. Android Security and Subversion of Privacy – Saurabh Kumar, IIT Kanpur -- 7. Block Chain for Data Integrity and Privacy – Need for an Indian Block Chain – Sandeep K. Shukla, Manindra Agrawal -- 8. Web Security for Robust Web Presence, Neha Ajmani, IIT Kanpur -- 9. Side Channel Attacks – Cache Based Leakage of Secure Data – Biswabandan Panda, IIT Kanpur -- 10. Smart Grid Security in India, S. C. Srivastava, Saikat Chakraborty -- 11. Hardware Security Research in India, Debdeep Mukhopadhyay, IIT KGP -- 12. Securing Enterprise IT Systems – Rajeev Mathur, Rapid7 -- 13. Indigenous Network Routers – Indian Effort to Create its own Routers, Manish Bajpai, Nivetti Systems -- 14. Cyber Security Global Academic Cooperation – IIT Kanpur’s Alliances with US, and Israeli Centers of Excellence in Cyber Security, Sandeep K. Shukla, IIT Kanpur. |
| Record Nr. | UNINA-9910383839203321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth
| FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 368 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36206-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Primality Testing with Gaussian Periods -- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple -- Encoding Generic Judgments -- Model Checking Algol-Like Languages Using Game Semantics -- Modeling Software: From Theory to Practice -- Contributed Papers -- Local Normal Forms for Logics over Traces -- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality -- Communication Interference in Mobile Boxed Ambients -- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity -- Composing Strand Spaces -- Generalising Automaticity to Modal Properties of Finite Structures -- An Automata-Theoretic Approach to Constraint LTL -- Hardness Results for Multicast Cost Sharing -- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols -- State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences -- Algorithmic Combinatorics Based on Slicing Posets -- Pattern Matching for Arc-Annotated Sequences -- Knowledge over Dense Flows of Time (from a Hybrid Point of View) -- The Complexity of the Inertia -- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version -- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures -- Deciding the First Level of the ?-Calculus Alternation Hierarchy -- Dynamic Message Sequence Charts -- The Complexity of Compositions of Deterministic Tree Transducers -- On the Hardness of Approximating Minimum Monopoly Problems -- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems -- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic -- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions -- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases -- Decomposition in Asynchronous Circuit Design -- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. |
| Record Nr. | UNISA-996465636603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth
| FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 368 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36206-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Primality Testing with Gaussian Periods -- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple -- Encoding Generic Judgments -- Model Checking Algol-Like Languages Using Game Semantics -- Modeling Software: From Theory to Practice -- Contributed Papers -- Local Normal Forms for Logics over Traces -- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality -- Communication Interference in Mobile Boxed Ambients -- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity -- Composing Strand Spaces -- Generalising Automaticity to Modal Properties of Finite Structures -- An Automata-Theoretic Approach to Constraint LTL -- Hardness Results for Multicast Cost Sharing -- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols -- State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences -- Algorithmic Combinatorics Based on Slicing Posets -- Pattern Matching for Arc-Annotated Sequences -- Knowledge over Dense Flows of Time (from a Hybrid Point of View) -- The Complexity of the Inertia -- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version -- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures -- Deciding the First Level of the ?-Calculus Alternation Hierarchy -- Dynamic Message Sequence Charts -- The Complexity of Compositions of Deterministic Tree Transducers -- On the Hardness of Approximating Minimum Monopoly Problems -- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems -- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic -- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions -- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases -- Decomposition in Asynchronous Circuit Design -- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. |
| Record Nr. | UNINA-9910143887703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Perspectives in computational complexity : the Somenath Biswas anniversary volume / / edited by Manindra Agrawal, Vikraman Arvind
| Perspectives in computational complexity : the Somenath Biswas anniversary volume / / edited by Manindra Agrawal, Vikraman Arvind |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2014 |
| Descrizione fisica | 1 online resource (206 p.) |
| Disciplina |
511.3
511.3/6 511.352 |
| Collana | Progress in Computer Science and Applied Logic |
| Soggetto topico |
Mathematical logic
Computer mathematics Mathematical Logic and Foundations Computational Science and Engineering Mathematical Logic and Formal Languages |
| ISBN | 3-319-05446-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- 1. Complexity Theory Basics: NP and NL (Vikraman Arvind) -- 2. Investigations Concerning the Structure of Complete Sets (Eric Allender) -- 3. Space Complexity of the Directed Reachability Problem Over Surface-embedded Graphs (N.V. Vinodchandran) -- 4. Algebraic Complexity Classes (Meena Mahajan) -- 5. A Selection of Lower Bound Results for Arithmetic Circuits (Neeraj Kayal and Ramprasad Saptharishi) -- 6. Explicit Tensors (Markus Bläser) -- 7. Progress on Polynomial Identity Testing (Nitin Saxena) -- 8. Malod and the Pascaline (Bruno Poizat) -- 9. A Tutorial in Time and Space Bounds for Tree-like Resolution (Jacobo Torán) -- 10. An Entropy Based Proof for the Moore Bound for Irregular Graphs (S. Ajesh Babu and Jaikumar Radharishnan) -- 11. Permutation Groups and the Graph Isomorphism Problem (Sumanta Ghosh and Piyush P. Kurur). |
| Record Nr. | UNINA-9910299982303321 |
| Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
| Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 423 p. 75 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-319-06089-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems. |
| Record Nr. | UNISA-996203623703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
| Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 423 p. 75 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-319-06089-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems. |
| Record Nr. | UNINA-9910483672403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 622 p. 91 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-642-29952-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465776103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||