top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Cryptographic hardware and embedded systems--CHES 2011 : 13th international workshop, Nara, Japan, September 28-October 1, 2011 : proceedings / Bart Preneel, Tsuyoshi Takagi, (eds.).
Cryptographic hardware and embedded systems--CHES 2011 : 13th international workshop, Nara, Japan, September 28-October 1, 2011 : proceedings / Bart Preneel, Tsuyoshi Takagi, (eds.).
Creatore [CHES (Workshop) (13th : 2011 : Nara-shi, Japan)]
Estensione 1 online resource (xiv, 524 pages) : illustrations (some color).
Disciplina 005.8
Accesso persona Preneel, Bart, 1963-
Takagi, Tsuyoshi (Mathematician)
Genere/Forma Electronic books
Soggetto non controllato Computer science
Data protection
Data structures (Computer science)
Data encryption (Computer science)
Coding theory
Computer software
Computational complexity
Data Encryption
Coding and Information Theory
Data Structures, Cryptology and Information Theory
Systems and Data Security
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
ISBN 9783642239519
364223951X
9783642239502
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-005710737
[CHES (Workshop) (13th : 2011 : Nara-shi, Japan)]  
Materiale a stampa
Lo trovi qui: New York University
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
Creatore [Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]
Estensione 1 online resource (xvii, 669 pages).
Disciplina 004
Accesso persona Fernández-Baca, David
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Electronic data processing
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
Computation by Abstract Devices
ISBN 9783642293443
3642293441
9783642293436
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Generalization of the Convex Kakeya Problem / Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson and Takeshi Tokuyama, et al. -- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines / Eric Angel, Evripidis Bampis and Vincent Chau -- Bichromatic 2-Center of Pairs of Points / Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar and Joseph S.B. Mitchell, et al. -- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs / Vikraman Arvind, Partha Mukhopadhyay and Prajakta Nimbhorkar -- A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem / Rafael da Ponte Barbosa and Yoshiko Wakabayashi -- On the Advice Complexity of the Knapsack Problem / Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter Rossmanith -- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems / Nicolas Boria, Jérôme Monnot and Vangelis Th. Paschos -- On Plane Constrained Bounded-Degree Spanners / Prosenjit Bose, Rolf Fagerberg, André van Renssen and Sander Verdonschot.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance / Joshua Brody, Hongyu Liang and Xiaoming Sun -- Density Classification on Infinite Lattices and Trees / Ana Bušić, Nazim Fatès, Jean Mairesse and Irène Marcovici -- Coloring Planar Homothets and Three-Dimensional Hypergraphs / Jean Cardinal and Matias Korman -- An Equivariance Theorem with Applications to Renaming / Armando Castañeda, Maurice Herlihy and Sergio Rajsbaum -- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks / Armando Castañeda, Damien Imbs, Sergio Rajsbaum and Michel Raynal -- Pseudorandomness of a Random Kronecker Sequence / Eda Cesaratto and Brigitte Vallée -- Revisiting the Cache Miss Analysis of Multithreaded Algorithms / Richard Cole and Vijaya Ramachandran -- Parameterized Complexity of MaxSat above Average / Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh -- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2n / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk.
On the Non-progressive Spread of Influence through Social Networks / MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi and Vahab Mirrokni, et al. -- Forbidden Patterns / Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein and Veli Mäkinen, et al. -- Structural Complexity of Multiobjective NP Search Problems / Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner and Maximilian Witek -- k-Gap Interval Graphs / Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan and Stefan Szeider, et al. -- Decidability Classes for Mobile Agents Computing / Pierre Fraigniaud and Andrzej Pelc -- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets / Bin Fu -- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width / Martin Fürer -- Indexed Multi-pattern Matching / Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Leena Salmela, et al. -- New Lower Bound on Max Cut of Hypergraphs with an Application to r-Set Splitting / Archontia C. Giannopoulou, Sudeshna Kolay and Saket Saurabh.
Cache Me If You Can: Capacitated Selfish Replication Games / Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan and Rajmohan Rajaraman, et al. -- The Efficiency of MapReduce in Parallel External Memory / Gero Greiner and Riko Jacob -- Algorithms for Some H-Join Decompositions / Michel Habib, Antoine Mamcarz and Fabien de Montgolfier -- On the Bend-Number of Planar and Outerplanar Graphs / Daniel Heldt, Kolja Knauer and Torsten Ueckerdt -- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations / Ahmed Helmi, Conrado Martínez and Alois Panholzer -- On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost / Wiebke Höhn and Tobias Jacobs -- Advantage of Overlapping Clusters for Minimizing Conductance / Rohit Khandekar, Guy Kortsarz and Vahab Mirrokni -- Independence of Tabulation-Based Hash Classes / Toryn Qwyllyn Klassen and Philipp Woelfel -- Oblivious Two-Way Finite Automata: Decidability and Complexity / Martin Kutrib, Andreas Malcher and Giovanni Pighizzini.
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs / Hélio B. Macêdo Filho, Raphael C.S. Machado and Celina M.H. Figueiredo -- Random Walks and Bisections in Random Circulant Graphs / Bernard Mans and Igor E. Shparlinski -- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem / Monaldo Mastrolilli -- Fully Analyzing an Algebraic Pólya Urn Model / Basile Morcrette -- Degree-Constrained Node-Connectivity / Zeev Nutov -- Survivable Network Activation Problems / Zeev Nutov -- On the Integrality Gap of the Subtour LP for the 1,2-TSP / Jiawei Qian, Frans Schalekamp, David P. Williamson and Anke van Zuylen -- A Theory and Algorithms for Combinatorial Reoptimization / Hadas Shachnai, Gal Tamir and Tami Tamir -- Capacity Achieving Two-Write WOM Codes / Amir Shpilka -- The Relationship between Inner Product and Counting Cycles / Xiaoming Sun, Chengu Wang and Wei Yu -- Approximating Minimum Label s-t Cut via Linear Programming / Linqing Tang and Peng Zhang.
A O(1/ε2)n-Time Sieving Algorithm for Approximate Integer Programming / Daniel Dadush -- Two-Dimensional Range Diameter Queries / Pooya Davoodi, Michiel Smid and Freek van Walderveen -- An Improved Upper Bound on the Density of Universal Random Graphs / Domingos Dellamonica, Yoshiharu Kohayakawa, Vojtěch Rödl and Andrzej Ruciński -- Logspace Computations in Graph Groups and Coxeter Groups / Volker Diekert, Jonathan Kausch and Markus Lohrey -- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points / Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce and Ladislav Stacho -- On the Radon Number for P3-Convexity / Mitre C. Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M. Schäfer and Jayme L. Szwarcfiter, et al. -- Computing Minimum Geodetic Sets of Proper Interval Graphs / Tınaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof and Daniel Meister -- Hausdorff Rank of Scattered Context-Free Linear Orders / Zoltán Ésik and Szabolcs Iván -- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism / Martín Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks.
Record Nr. NYU-004374940
[Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]  
Materiale a stampa
Lo trovi qui: New York University
Combinatorial pattern matching : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings / Juha Kärkkäinen, Jens Stoye (eds.).
Combinatorial pattern matching : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings / Juha Kärkkäinen, Jens Stoye (eds.).
Creatore [CPM (Symposium) (23rd : 2012 : Helsinki, Finland)]
Estensione 1 online resource.
Disciplina 005.1
Accesso persona Kärkkäinen, Juha
Stoye, Jens
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Optical pattern recognition
Bioinformatics
Pattern Recognition
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
Data Structures
Computational Biology/Bioinformatics
ISBN 9783642312656
3642312659
9783642312649
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Gene Regulation, Protein Networks and Disease: A Computational Perspective / Ron Shamir -- Wavelet Trees for All / Gonzalo Navarro -- The Maximum Number of Squares in a Tree / Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica and Jakub Radoszewski, et al. -- Faster and Simpler Minimal Conflicting Set Identification / (Extended Abstract) / Aïda Ouangraoua and Mathieu Raffinot -- Partitioning into Colorful Components by Minimum Edge Deletions / Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier and Sven Thiel, et al. -- Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations / Dima Blokh, Danny Segev and Roded Sharan -- Constant-Time Word-Size String Matching / Dany Breslauer, Leszek Gąsieniec and Roberto Grossi -- Pattern Matching in Multiple Streams / Raphaël Clifford, Markus Jalsenius, Ely Porat and Benjamin Sach -- An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata / Omar AitMous, Frédérique Bassino and Cyril Nicaud -- Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation / Christian Hundt and Florian Wendland -- Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths / Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada and Stéphane Vialette -- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence / Ferdinando Cicalese, Eduardo Laber, Oren Weimann and Raphael Yuster -- The Complexity of String Partitioning / Anne Condon, Ján Maňuch and Chris Thachuk -- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval / Wing-Kai Hon, Rahul Shah and Sharma V. Thankachan -- Document Listing for Queries with Excluded Pattern / Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan and Jeffrey Scott Vitter -- Cross-Document Pattern Matching / Gregory Kucherov, Yakov Nekrich and Tatiana Starikovskaya -- FEMTO: Fast Search of Large Sequence Collections / Michael P. Ferguson -- Speeding Up q-Gram Mining on Grammar-Based Compressed Texts / Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda -- Simple and Efficient LZW-Compressed Multiple Pattern Matching / Paweł Gawrychowski -- Computing the Burrows-Wheeler Transform of a String and Its Reverse / Enno Ohlebusch, Timo Beller and Mohamed I. Abouelhoda -- Efficient Algorithm for Circular Burrows-Wheeler Transform / Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah and Sharma V. Thankachan -- Least Random Suffix/Prefix Matches in Output-Sensitive Time / Niko Välimäki -- Compressed String Dictionary Look-Up with Edit Distance One / Djamal Belazzougui and Rossano Venturini -- Time-Space Trade-Offs for Longest Common Extensions / Philip Bille, Inge Li Gørtz, Benjamin Sach and Hjalte Wedel Vildhøj -- Local Exact Pattern Matching for Non-fixed RNA Structures / Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau and Mathias Möhl, et al. -- Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots / Saad Sheikh, Rolf Backofen and Yann Ponty -- Finding Longest Common Segments in Protein Structures in Nearly Linear Time / Yen Kaow Ng, Hirotaka Ono, Ling Ge and Shuai Cheng Li -- A Linear Kernel for the Complementary Maximal Strip Recovery Problem / Haitao Jiang and Binhai Zhu -- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees / Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa and Atsuhiro Takasu -- Fixed-Parameter Algorithms for Finding Agreement Supertrees / David Fernández-Baca, Sylvain Guillemot, Brad Shutters and Sudheer Vakati -- Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles / Jesper Jansson and Andrzej Lingas -- Minimum Leaf Removal for Reconciliation: Complexity and Algorithms / Riccardo Dondi and Nadia El-Mabrouk -- On the Closest String via Rank Distance / Liviu P. Dinu and Alexandru Popa -- On Approximating String Selection Problems with Outliers / Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard and Oren Weimann -- The Parameterized Complexity of the Shared Center Problem / Zhi-Zhong Chen, Lusheng Wang and Wenji Ma.
Record Nr. NYU-004375687
[CPM (Symposium) (23rd : 2012 : Helsinki, Finland)]  
Materiale a stampa
Lo trovi qui: New York University
Lectures on logic and computation : ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected lecture notes / Nick Bezhanishvili, Valentin Goranko (eds.).
Lectures on logic and computation : ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected lecture notes / Nick Bezhanishvili, Valentin Goranko (eds.).
Creatore [European Summer School in Logic, Language, and Information (22nd : 2010 : Copenhagen, Denmark)]
Estensione 1 online resource (263 pages) : illustrations.
Disciplina 005.101/5113
Accesso persona Bezhanishvili, Nick
Goranko, Valentin
Accesso convegno European Summer School in Logic, Language, and Information (23rd : 2011 : Ljubljana, Slovenia)
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Logic design
Computational complexity
Artificial intelligence
Logic, Symbolic and mathematical
Logics and Meanings of Programs
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Discrete Mathematics in Computer Science
ISBN 9783642314858
3642314856
9783642314841
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Proof Complexity of Non-classical Logics / Olaf Beyersdorff and Oliver Kutz -- Ten Problems of Deontic Logic and Normative Reasoning in Computer Science / Jan Broersen and Leendert van der Torre -- A Short Introduction to Implicit Computational Complexity / Ugo Dal Lago -- Strategies in Games: A Logic-Automata Study / Sujata Ghosh and R. Ramanujam -- Introduction to Judgment Aggregation / Davide Grossi and Gabriella Pigozzi -- Specification and Verification of Multi-Agent Systems / Wojciech Jamroga and Wojciech Penczek.
Record Nr. NYU-004375805
[European Summer School in Logic, Language, and Information (22nd : 2010 : Copenhagen, Denmark)]  
Materiale a stampa
Lo trovi qui: New York University
Topics in cryptology-- CT-RSA 2012 : the Cryptographers' track at the RSA Conference 2012, San Francisco, CA, USA, February 27-March 2, 2012. Proceedings / Orr Dunkelman (ed.).
Topics in cryptology-- CT-RSA 2012 : the Cryptographers' track at the RSA Conference 2012, San Francisco, CA, USA, February 27-March 2, 2012. Proceedings / Orr Dunkelman (ed.).
Creatore [Cryptographers' Track at RSA Conference (2012 : San Francisco, Calif.)]
Estensione 1 online resource (xiii, 434 pages).
Disciplina 005.8/2
Accesso persona Dunkelman, Orr.
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Computational complexity
Discrete Mathematics in Computer Science
Systems and Data Security
Algorithm Analysis and Problem Complexity
ISBN 9783642279546
3642279546
9783642279539
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004621869
[Cryptographers' Track at RSA Conference (2012 : San Francisco, Calif.)]  
Materiale a stampa
Lo trovi qui: New York University
Logic Functions and Equations [electronic resource] : Examples and Exercises / by Bernd Steinbach, Christian Posthoff
Logic Functions and Equations [electronic resource] : Examples and Exercises / by Bernd Steinbach, Christian Posthoff
Creatore [Steinbach, Bernd]
Accesso persona Posthoff, Christian
Accesso ente SpringerLink (Online service)
Soggetto non controllato Logics and Meanings of Programs
Circuits and Systems
Discrete Mathematics in Computer Science
Computer Science
ISBN 9781402095955
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7720169
[Steinbach, Bernd]  
Software
Lo trovi qui: University of Chicago
Elementare Kombinatorik für die Informatik [electronic resource] : Abzählungen, Differenzengleichungen, diskretes Differenzieren und Integrieren / von Kurt-Ulrich Witt
Elementare Kombinatorik für die Informatik [electronic resource] : Abzählungen, Differenzengleichungen, diskretes Differenzieren und Integrieren / von Kurt-Ulrich Witt
Creatore [Witt, Kurt-Ulrich]
Estensione 1 online resource
Disciplina 004.0151
Soggetto non controllato Discrete Mathematics in Computer Science
Mathematics, general
Computer Science
ISBN 9783658009946
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione ger
Nota di contenuto Permutationen und Kombinationen -- Partitionen -- Abzählmethoden und das Urnenmodell -- Erzeugende Funktionen -- Lineare Differenzengleichungen -- Diskretes Differenzieren und Integrieren -- Anhang und Lösungen zu den Aufgaben.
Record Nr. UCHICAGO-9284416
[Witt, Kurt-Ulrich]  
Risorse elettroniche
Lo trovi qui: University of Chicago
Structural information and communication complexity : 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Proceedings / Guy Even, Magnús M. Halldórsson (eds.).
Structural information and communication complexity : 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Proceedings / Guy Even, Magnús M. Halldórsson (eds.).
Creatore [Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)]
Estensione 1 online resource (xix, 340 pages) : illustrations.
Accesso persona Even, Guy.
Magnús M. Halldórsson
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
ISBN 9783642311048
3642311040
3642311032
9783642311031
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Space Lower Bounds for Low-Stretch Greedy Embeddings / Ioannis Caragiannis and Christos Kalaitzis -- The Fault Tolerant Capacitated k-Center Problem / Shiri Chechik and David Peleg -- Notions of Connectivity in Overlay Networks / Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg -- Changing of the Guards: Strip Cover with Duty Cycling / Amotz Bar-Noy, Ben Baumer and Dror Rawitz -- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring / Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela -- An Algorithm for Online Facility Leasing / Peter Kling, Friedhelm Meyer auf der Heide and Peter Pietrzyk -- Agreement in Directed Dynamic Networks / Martin Biely, Peter Robinson and Ulrich Schmid -- Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position / Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar -- Strong Connectivity of Sensor Networks with Double Antennae / Mohsen Eftekhari Hesari, Evangelos Kranakis, Fraser MacQuarie, Oscar Morales-Ponce and Lata Narayanan -- Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model / Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau -- Wireless Network Stability in the SINR Model / Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson and Pradipta Mitra -- What Can Be Computed without Communications? / Heger Arfaoui and Pierre Fraigniaud -- On Bidimensional Congestion Games / Vittorio Bilò, Michele Flammini and Vasco Gallotti -- Mobile Network Creation Games / Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli -- Homonyms with Forgeable Identifiers / Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The -- Asynchrony and Collusion in the N-party BAR Transfer Problem / Xavier Vilaça, Oksana Denysyuk and Luís Rodrigues -- Early Deciding Synchronous Renaming in O(logf) Rounds or Less / Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers -- On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract) / Jérémie Chalopin, Yves Métivier and Thomas Morsellino -- Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems / Andreas Larsson and Philippas Tsigas -- Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors / Michel Raynal and Julien Stainer -- Improved Approximation for Orienting Mixed Graphs / Iftah Gamzu and Moti Medina -- Analysis of Random Walks Using Tabu Lists / Karine Altisen, Stéphane Devismes, Antoine Gerbaud and Pascal Lafourcade -- Online Graph Exploration with Advice / Stefan Dobrev, Rastislav Královič and Euripides Markou -- Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles / Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro -- Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization / Samir Elouasbi and Andrzej Pelc -- Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks / Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa -- Getting Close without Touching / Linda Pagli, Giuseppe Prencipe and Giovanni Viglietta -- Gathering of Robots on Anonymous Grids without Multiplicity Detection / Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra.
Record Nr. UCHICAGO-11077025
[Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Information security and cryptology-- ICISC 2011 : 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised selected papers / Howon Kim (ed.).
Information security and cryptology-- ICISC 2011 : 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised selected papers / Howon Kim (ed.).
Creatore [ICISC (Conference) (14th : 2011 : Seoul, Korea)]
Estensione 1 online resource (xii, 512 pages) : illustrations.
Accesso persona Kim, Howon
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Computational complexity
Information Systems
Management of Computing and Information Systems
Algorithm Analysis and Problem Complexity
Systems and Data Security
Discrete Mathematics in Computer Science
ISBN 9783642319129
3642319122
3642319114
9783642319112
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Improved Integral Analysis on Tweaked Lesamnta / Yu Sasaki and Kazumaro Aoki -- Analysis of Trivium Using Compressed Right Hand Side Equations / Thorsten Ernst Schilling and Håvard Raddum -- Cryptanalysis of Round-Reduced HAS-160 / Florian Mendel, Tomislav Nad and Martin Schläffer -- An Efficient Method for Eliminating Random Delays in Power Traces of Embedded Software / Daehyun Strobel and Christof Paar -- An Efficient Leakage Characterization Method for Profiled Power Analysis Attacks / Hailong Zhang, Yongbin Zhou and Dengguo Feng -- Correcting Errors in Private Keys Obtained from Cold Boot Attacks / Hyung Tae Lee, HongTae Kim, Yoo-Jin Baek and Jung Hee Cheon -- Strong Security Notions for Timed-Release Public-Key Encryption Revisited / Ryo Kikuchi, Atsushi Fujioka, Yoshiaki Okamoto and Taiichi Saito -- Fully Secure Unidirectional Identity-Based Proxy Re-encryption / Song Luo, Qingni Shen and Zhong Chen -- Detecting Parasite P2P Botnet in eMule-like Networks through Quasi-periodicity Recognition / Yong Qiao, Yuexiang Yang, Jie He, Bo Liu and Yingzhi Zeng -- AutoDunt: Dynamic Latent Dependence Analysis for Detection of Zero Day Vulnerability / Kai Chen, Yifeng Lian and Yingjun Zhang -- Weaknesses in Current RSA Signature Schemes / Juliane Krämer, Dmitry Nedospasov and Jean-Pierre Seifert.
Back Propagation Neural Network Based Leakage Characterization for Practical Security Analysis of Cryptographic Implementations / Shuguo Yang, Yongbin Zhou, Jiye Liu and Danyang Chen -- A Revocable Group Signature Scheme with the Property of Hiding the Number of Revoked Users / Keita Emura, Atsuko Miyaji and Kazumasa Omote -- Generic Constructions for Verifiable Signcryption / Laila El Aimani -- Non-delegatable Strong Designated Verifier Signature on Elliptic Curves / Haibo Tian, Xiaofeng Chen, Zhengtao Jiang and Yusong Du -- An Improved Known Plaintext Attack on PKZIP Encryption Algorithm / Kyung Chul Jeong, Dong Hoon Lee and Daewan Han -- Synthetic Linear Analysis: Improved Attacks on CubeHash and Rabbit / Yi Lu, Serge Vaudenay, Willi Meier, Liping Ding and Jianchun Jiang -- On the Resistance of Boolean Functions against Fast Algebraic Attacks / Yusong Du, Fangguo Zhang and Meicheng Liu -- CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model / Yu Chen, Liqun Chen and Zongyang Zhang -- Design, Implementation, and Evaluation of a Vehicular Hardware Security Module / Marko Wolf and Timo Gendrullis -- Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection / Jothi Rangasamy, Douglas Stebila, Lakshmi Kuppusamy, Colin Boyd and Juan Gonzalez Nieto -- Implementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering / Paolo Palmieri and Olivier Pereira.
Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing / Shoichi Hirose, Hidenori Kuwakado and Hirotaka Yoshida -- Biclique Attack on the Full HIGHT / Deukjo Hong, Bonwook Koo and Daesung Kwon -- Preimage Attacks on Step-Reduced SM3 Hash Function / Jian Zou, Wenling Wu, Shuang Wu, Bozhan Su and Le Dong -- Breaking a 3D-Based CAPTCHA Scheme / Vu Duc Nguyen, Yang-Wai Chow and Willy Susilo -- Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control / Fangming Zhao, Takashi Nishide and Kouichi Sakurai -- Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes / Zhenfei Zhang, Thomas Plantard and Willy Susilo -- A Blind Digital Image Watermarking Method Based on the Dual-Tree Complex Discrete Wavelet Transform and Interval Arithmetic / Teruya Minamoto and Ryuji Ohura -- On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks / Ashish Choudhury and Arpita Patra -- Two-Party Round-Optimal Session-Policy Attribute-Based Authenticated Key Exchange without Random Oracles / Kazuki Yoneyama -- Sufficient Condition for Identity-Based Authenticated Key Exchange Resilient to Leakage of Secret Keys / Atsushi Fujioka and Koutarou Suzuki.
Record Nr. UCHICAGO-11077079
[ICISC (Conference) (14th : 2011 : Seoul, Korea)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Developments in language theory : 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings / Hsu-Chun Yen, Oscar H. Ibarra (eds.).
Developments in language theory : 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings / Hsu-Chun Yen, Oscar H. Ibarra (eds.).
Creatore [Conference on Developments in Language Theory (16th : 2012 : Taipei, Taiwan)]
Estensione 1 online resource (xiv, 478 pages) : illustrations.
Accesso persona Yen, Hsu-Chun, 1958-
Ibarra, Oscar H.
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Coding theory
Logic design
Computational complexity
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
Coding and Information Theory
Discrete Mathematics in Computer Science
ISBN 9783642316531
3642316530
3642316522
9783642316524
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012 / Andrew L. Szilard -- P and dP Automata: Unconventional versus Classical Automata / Erzsébet Csuhaj-Varjú -- Recovering Strings in Oracles: Quantum and Classic / Kazuo Iwama -- Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ / Juraj Hromkovič, Rastislav Královič, Richard Královič and Richard Štefanec -- Cellular Automata, the Collatz Conjecture and Powers of 3/2 / Jarkko Kari -- Quotient Complexities of Atoms of Regular Languages / Janusz Brzozowski and Hellis Tamm -- Decidability of Geometricity of Regular Languages / Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne and Sylvain Lombardy -- Inside the Class of REGEX Languages / Markus L. Schmid -- Computing the Edit-Distance between a Regular Language and a Context-Free Language / Yo-Sub Han, Sang-Ki Ko and Kai Salomaa -- Semigroups with a Context-Free Word Problem / Michael Hoffmann, Derek F. Holt, Matthew D. Owens and Richard M. Thomas -- Generalized Derivations with Synchronized Context-Free Grammars / Markus Holzer, Sebastian Jakobi and Ian McQuillan -- Non-erasing Variants of the Chomsky-Schützenberger Theorem / Alexander Okhotin -- Regular and Context-Free Pattern Languages over Small Alphabets / Daniel Reidenbach and Markus L. Schmid.
On Context-Free Languages of Scattered Words / Zoltan Ésik and Satoshi Okawa -- Homomorphisms Preserving Deterministic Context-Free Languages / Tommi Lehtinen and Alexander Okhotin -- Unary Coded NP-Complete Languages in ASPACE (log log n) / Viliam Geffert and Dana Pardubská -- Dense Completeness / Andreas Krebs and Klaus-Jörn Lange -- From Equivalence to Almost-Equivalence, and Beyond--Minimizing Automata with Errors (Extended Abstract) / Markus Holzer and Sebastian Jakobi -- Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata / Christos A. Kapoutsis and Nans Lefebvre -- States and Heads Do Count for Unary Multi-head Finite Automata / Martin Kutrib, Andreas Malcher and Matthias Wendlandt -- Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness / Mathieu Caralp, Pierre-Alain Reynier and Jean-Marc Talbot -- Unambiguous Constrained Automata / Michaël Cadilhac, Alain Finkel and Pierre McKenzie -- Two-Dimensional Sgraffito Automata / Daniel Průša and František Mráz -- Two-Way Transducers with a Two-Way Output Tape / Olivier Carton -- Learning Rational Functions / Adrien Boiret, Aurélien Lemay and Joachim Niehren -- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata / Giovanna J. Lavado, Giovanni Pighizzini and Shinnosuke Seki -- Fine and Wilf's Theorem for k-Abelian Periods / Juhani Karhumäki, Svetlana Puzynina and Aleksi Saarela -- Pseudoperiodic Words / Alexandre Blondin Massé, Sébastien Gaboury and Sylvain Hallé
Acceptance Conditions for [omega]-Languages / Alberto Dennunzio, Enrico Formenti and Julien Provillard -- Checking Determinism of Regular Expressions with Counting / Haiming Chen and Ping Lu -- Biautomata for k-Piecewise Testable Languages / Ondřej Klíma and Libor Polák -- On Centralized PC Grammar Systems with Context-Sensitive Components / Friedrich Otto -- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars / Matthias Büchse, Andreas Maletti and Heiko Vogler -- The State Complexity of Star-Complement-Star / Galina Jirásková and Jeffrey Shallit -- On State Complexity of Finite Word and Tree Languages / Aniruddh Gandhi, Bakhadyr Khoussainov and Jiamou Liu -- Squares in Binary Partial Words / Francine Blanchet-Sadri, Yang Jiao and John M. Machacek -- The Avoidability of Cubes under Permutations / Florin Manea, Mike Müller and Dirk Nowotka -- Hairpin Completion with Bounded Stem-Loop / Szilárd Zsolt Fazekas, Robert Mercaş and Kayoko Shikishima-Tsuji -- Morphic Primitivity and Alphabet Reductions / Hossein Nevisi and Daniel Reidenbach -- On a Hierarchy of Languages with Catenation and Shuffle / Nils Erik Flick and Manfred Kudlek -- Characterizing Languages by Normalization and Termination in String Rewriting (Extended Abstract) / Jeroen Ketema and Jakob Grue Simonsen -- Geometry and Dynamics of the Besicovitch and Weyl Spaces / Ville Salo and Ilkka Törmä -- A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay / Laura Giambruno, Sabrina Mantaci, Jean Néraud and Carla Selmi.
Record Nr. UCHICAGO-11077093
[Conference on Developments in Language Theory (16th : 2012 : Taipei, Taiwan)]  
Materiale a stampa
Lo trovi qui: University of Chicago