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.
Theory of cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / Amit Sahai (ed.).
Theory of cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / Amit Sahai (ed.).
Creatore [Theory of Cryptography Conference (10th : 2013 : Tokyo, Japan)]
Estensione 1 online resource.
Disciplina 005.8/2
Accesso persona Sahai, Amit
Soggetto non controllato Computer science
Data protection
Data encryption (Computer science)
Computer software
Systems and Data Security
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
ISBN 9783642365942
3642365949
3642365930
9783642365935
Classificazione 54.62
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Overcoming Weak Expectations / Yevgeniy Dodis, Yu Yu -- A Counterexample to the Chain Rule for Conditional HILL Entropy / Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia -- Hardness Preserving Reductions via Cuckoo Hashing / Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor -- Concurrent Zero Knowledge in the Bounded Player Model / Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson -- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model / Ran Canetti, Huijia Lin, Omer Paneth -- Succinct Malleable NIZKs and an Application to Compact Shuffles / Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya -- Encrypted Messages from the Heights of Cryptomania / Craig Gentry -- Attribute-Based Functional Encryption on Lattices / Xavier Boyen -- When Homomorphism Becomes a Liability / Zvika Brakerski -- Garbling XOR Gates "For Free" in the Standard Model / Benny Applebaum -- Why "Fiat-Shamir for Proofs" Lacks a Proof / Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain.
On the (In)security of Fischlin's Paradigm / Prabhanjan Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao -- Signatures of Correct Computation / Charalampos Papamanthou, Elaine Shi, Roberto Tamassia -- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness / Gilad Asharov, Yehuda Lindell, Tal Rabin -- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities / R. Amzi Jeffs, Mike Rosulek -- Feasibility and Completeness of Cryptographic Tasks in the Quantum World / Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou -- Languages with Efficient Zero-Knowledge PCPs are in SZK / Mohammad Mahmoody, David Xiao -- Succinct Non-interactive Arguments via Linear Interactive Proofs / Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Omer Paneth -- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments / Rafael Pass -- Secure Computation for Big Data / Tal Malkin -- Communication Locality in Secure Multi-party Computation / Elette Boyle, Shafi Goldwasser, Stefano Tessaro.
Distributed Oblivious RAM for Secure Two-Party Computation / Steve Lu, Rafail Ostrovsky -- Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead / Steven Myers, Mona Sergi, abhi shelat -- Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy / Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova -- Limits on the Usefulness of Random Oracles / Iftach Haitner, Eran Omri, Hila Zarosim -- Analyzing Graphs with Node Differential Privacy / Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova -- Universally Composable Synchronous Computation / Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas -- Multi-Client Non-interactive Verifiable Computation / Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid -- On the Feasibility of Extending Oblivious Transfer / Yehuda Lindell, Hila Zarosim -- Computational Soundness of Coinductive Symbolic Security under Active Attacks / Mohammad Hajiabadi, Bruce M. Kapron.
Revisiting Lower and Upper Bounds for Selective Decommitments / Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro -- On the Circular Security of Bit-Encryption / Ron D. Rothblum -- Cryptographic Hardness of Random Local Functions-Survey / Benny Applebaum -- On the Power of Correlated Randomness in Secure Computation / Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi -- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing / Ivan Damgård, Sarah Zakarias -- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens / Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges -- A Cookbook for Black-Box Separations and a Recipe for UOWHFs / Kfir Barhum, Thomas Holenstein -- Algebraic (Trapdoor) One-Way Functions and Their Applications / Dario Catalano, Dario Fiore, Rosario Gennaro -- Randomness-Dependent Message Security / Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang -- Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks / David Xiao.
Record Nr. STANFORD-a10092522
[Theory of Cryptography Conference (10th : 2013 : Tokyo, Japan)]  
Materiale a stampa
Lo trovi qui: Stanford University
Integer programming and combinatorial optimization : 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings / Michel Goemans, José Correa (eds.).
Integer programming and combinatorial optimization : 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings / Michel Goemans, José Correa (eds.).
Creatore [Conference on Integer Programming and Combinatorial Optimization (16th : 2013 : Valparaíso, Chile)]
Estensione 1 online resource (xi, 400 pages) : illustrations.
Disciplina 519.7/7
Accesso persona Goemans, Michel, editor
Correa, José, editor
Soggetto non controllato Computer science
Computer software
Electronic data processing
Computational complexity
Numeric Computing
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
ISBN 9783642366949
3642366945
3642366937
9783642366932
Classificazione 31.12
54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On the Structure of Reduced Kernel Lattice Bases / Karen Aardal, Frederik von Heymann -- All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns / Ron Adany, Moran Feldman, Elad Haramaty -- Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / Aris Anagnostopoulos, Fabrizio Grandoni -- Intersection Cuts for Mixed Integer Conic Quadratic Sets / Kent Andersen, Anders Nedergaard Jensen -- Content Placement via the Exponential Potential Function Method / David Applegate, Aaron Archer -- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case / Amitabh Basu, Robert Hildebrand -- Blocking Optimal Arborescences / Attila Bernáth, Gyula Pap -- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property / Flavia Bonomo, Gianpaolo Oriolo -- A Complexity and Approximability Study of the Bilevel Knapsack Problem / Alberto Caprara, Margarida Carvalho -- Matroid and Knapsack Center Problems / Danny Z. Chen, Jian Li, Hongyu Liang.
Cut-Generating Functions / Michele Conforti, Gérard Cornuéjols -- Reverse Chvátal-Gomory Rank / Michele Conforti, Alberto Del Pia -- On Some Generalizations of the Split Closure / Sanjeeb Dash, Oktay Günlük -- Packing Interdiction and Partial Covering Problems / Michael Dinitz, Anupam Gupta -- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / Hongbo Dong, Jeff Linderoth -- An Improved Integrality Gap for Asymmetric TSP Paths / Zachary Friggstad, Anupam Gupta, Mohit Singh -- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids / Bertrand Guenin, Leanne Stuive -- A Stochastic Probing Problem with Applications / Anupam Gupta, Viswanath Nagarajan -- Thrifty Algorithms for Multistage Robust Optimization / Anupam Gupta, Viswanath Nagarajan -- Shallow-Light Steiner Arborescences with Vertex Delays / Stephan Held, Daniel Rotter -- Two Dimensional Optimal Mechanism Design for a Sequencing Problem / Ruben Hoeksma, Marc Uetz.
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case / Patrick Jaillet, José A. Soto -- A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets / Diego Alejandro Morán Ramírez -- The Complexity of Scheduling for p-Norms of Flow and Stretch / Benjamin Moseley, Kirk Pruhs, Cliff Stein -- The Euclidean k-Supplier Problem / Viswanath Nagarajan, Baruch Schieber -- Facial Structure and Representation of Integer Hulls of Convex Sets / Vishnu Narayanan -- An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem / Tim Nonner, Maxim Sviridenko -- Chain-Constrained Spanning Trees / Neil Olver, Rico Zenklusen -- A Simpler Proof for O(Congestion+Dilation) Packet Routing / Thomas Rothvoß -- 0/1 Polytopes with Quadratic Chvátal Rank / Thomas Rothvoß, Laura Sanitá -- Eight-Fifth Approximation for the Path TSP / András Sebő -- Fast Deterministic Algorithms for Matrix Completion Problems / Tasuku Soma -- Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines / Maxim Sviridenko, Andreas Wiese.
Record Nr. STANFORD-a10101700
[Conference on Integer Programming and Combinatorial Optimization (16th : 2013 : Valparaíso, Chile)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings / Ding-Zhu Du, Guochuan Zhang (eds.).
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings / Ding-Zhu Du, Guochuan Zhang (eds.).
Creatore [COCOON (Conference) (19th : 2013 : Hangzhou, China)]
Estensione 1 online resource (xviii, 861 pages) : illustrations (black and white).
Disciplina 003/.56
Accesso persona Du, Dingzhu, editor
Zhang, Guochuan, editor
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Logic design
Computational complexity
Artificial intelligence
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642387685
3642387683
9783642387678
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Keynote. Recent Results for Online Makespan Minimization / Susanne Albers -- Optimal Stopping Meets Combinatorial Optimization / Robert Kleinberg -- Game Theory. New Bounds for the Balloon Popping Problem / Davide Bilò, Vittorio Bilò -- On the Sequential Price of Anarchy of Isolation Games / Anna Angelucci [and others] -- Social Exchange Networks with Distant Bargaining / Konstantinos Georgiou [and others] -- The 1/4-Core of the Uniform Bin Packing Game Is Nonempty / Walter Kern, Xian Qiu -- Randomized Algorithms. On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles / Maria Paola Bianchi [and others] -- On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets / Khaled Elbassioni [and others] -- A Fast Algorithm for Data Collection along a Fixed Track / Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson -- Random Methods for Parameterized Problems / Qilong Feng [and others].
Scheduling Algorithms. DVS Scheduling in a Line or a Star Network of Processors / Zongxu Mu, Minming Li -- Online Algorithms for Batch Machines Scheduling with Delivery Times / Peihai Liu, Xiwen Lu -- How to Schedule the Marketing of Products with Negative Externalities / Zhigang Cao, Xujin Chen, Changjun Wang -- From Preemptive to Non-preemptive Speed-Scaling Scheduling / Evripidis Bampis [and others] -- Computational Theory. Selection from Read-Only Memory with Limited Workspace / Amr Elmasry [and others] -- Deternimization of Büchi Automata as Partitioned Automata / Cong Tian, Zhenhua Duan, Mengfei Yang -- On Linear-Size Pseudorandom Generators and Hardcore Functions / Joshua Baron, Yuval Ishai, Rafail Ostrovsky -- A Fast Algorithm Finding the Shortest Reset Words / Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła.
Computational Geometry. The Discrete Voronoi Game in a Simple Polygon / Aritra Banik [and others] -- Facets for Art Gallery Problems / Sándor P. Fekete [and others] -- Hitting and Piercing Rectangles Induced by a Point Set / Ninad Rajgopal [and others] -- Realistic Roofs over a Rectilinear Polygon Revisited / Jessica Sherette, Sang Duk Yoon -- Graph Algorithms I. Parametric Power Supply Networks / Shiho Morishita, Takao Nishizeki -- Approximating the Minimum Independent Dominating Set in Perturbed Graphs / Weitian Tong, Randy Goebel, Guohui Lin -- A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property / Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang -- On the Conjunctive Capacity of Graphs / Miroslav Chlebík, Janka Chlebíková
Approximation Algorithms. Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty / Yu Li [and others] -- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems / Chenchen Wu, Donglei Du, Dachuan Xu -- Improved Local Search for Universal Facility Location / Eric Angel, Nguyen Kim Thang, Damien Regnault -- Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints / Longkun Guo, Hong Shen, Kewen Liao -- Graph Algorithms II. The k-Separator Problem / Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto -- On the Treewidth of Dynamic Graphs / Bernard Mans, Luke Mathieson -- Square-Orthogonal Drawing with Few Bends per Edge / Yu-An Lin, Sheung-Hung Poon -- Covering Tree with Stars / Jan Baumbach, Jiong Guo, Rashid Ibragimov.
Computational Biology. A Polynomial Time Approximation Scheme for the Closest Shared Center Problem / Weidong Li, Lusheng Wang, Wenjuan Cui -- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies / Nan Liu [and others] -- An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance / Kun-Tze Chen [and others] -- A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics / Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum -- Graph Algorithms III. Maximum Balanced Subgraph Problem Parameterized above Lower Bound / Robert Crowston [and others] -- A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies / Peter Damaschke, Azam Sheikh Muhammad -- A Linear Edge Kernel for Two-Layer Crossing Minimization / Yasuaki Kobayashi [and others] -- A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product / Christophe Crespelle, Eric Thierry, Thomas Lambert.
Online Algorithms. Metrical Service Systems with Multiple Servers / Ashish Chiplunkar, Sundar Vishwanathan -- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity / Hans-Joachim Böckenhauer [and others] -- Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing / Yong Zhang [and others] -- Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints / Hiroshi Fujiwara, Koji Kobayashi -- Parameterized Algorithms. Parameterized Complexity of Flood-Filling Games on Trees / Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva -- Parameterized Approximability of Maximizing the Spread of Influence in Networks / Cristina Bazgan [and others] -- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs / Yunlong Liu [and others] -- Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees / Feng Shi [and others].
Computational Complexity. Small H-Coloring Problems for Bounded Degree Digraphs / Pavol Hell, Aurosish Mishra -- Bounded Model Checking for Propositional Projection Temporal Logic / Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He -- Packing Cubes into a Cube Is NP-Hard in the Strong Sense / Yiping Lu, Danny Z. Chen, Jianzhong Cha -- On the Complexity of Solving or Approximating Convex Recoloring Problems / Manoel B. Campêlo [and others] -- Algorithms. 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth / Jasine Babu [and others] -- How to Catch L 2-Heavy-Hitters on Sliding Windows / Vladimir Braverman, Ran Gelles, Rafail Ostrovsky -- Time/Memory/Data Tradeoffs for Variants of the RSA Problem / Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz -- An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship / Tao Hu, Xianyi Ren, Jihong Zhang.
Workshop I. Straight-Line Monotone Grid Drawings of Series-Parallel Graphs / Md. Iqbal Hossain, Md. Saidur Rahman -- Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems / Kameng Nip, Zhenbo Wang -- The Program Download Problem: Complexity and Algorithms / Chao Peng [and others] -- Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic / Hongbiao Gao [and others] -- Workshop II. Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data / Xingwu Liu, Shang-Hua Teng -- Sublinear Time Approximate Sum via Uniform Random Sampling / Bin Fu, Wenfeng Li, Zhiyong Peng -- Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) / Zhao Lu, Tian Liu, Ke Xu -- On the Minimum Caterpillar Problem in Digraphs / Taku Okada [and others].
CSoNet I. A New Model for Product Adoption over Social Networks / Lidan Fan [and others] -- Generating Uncertain Networks Based on Historical Network Snapshots / Meng Han [and others] -- A Short-Term Prediction Model of Topic Popularity on Microblogs / Juanjuan Zhao [and others] -- Social Network Path Analysis Based on HBase / Yan Qiang [and others] -- CSoNet II. Community Expansion Model Based on Charged System Theory / Yuanjun Bi [and others] -- Centrality and Spectral Radius in Dynamic Communication Networks / Danica Vukadinović Greetham, Zhivko Stoyanov, Peter Grindrod -- Finding Network Communities Using Random Walkers with Improved Accuracy / You Li [and others] -- Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category / Adib Rastegarnia, Meysam Mohajer, Vahid Solouk.
CSoNet III. Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks / Li Wang [and others] -- Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks / Anurag Singh, Rahul Kumar, Yatindra Nath Singh -- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network / Donghyun Kim [and others] -- Using Network Sciences to Evaluate the Brazilian Airline Network / Douglas Oliveira, Marco Carvalho, Ronaldo Menezes.
Record Nr. STANFORD-a10166169
[COCOON (Conference) (19th : 2013 : Hangzhou, China)]  
Materiale a stampa
Lo trovi qui: Stanford University
Unconventional computation and natural computation : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. Proceedings / Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca (eds.).
Unconventional computation and natural computation : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. Proceedings / Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca (eds.).
Creatore [UCNC (Conference) (12th : 2013 : Milan, Italy)]
Estensione 1 online resource (xv, 262 pages) : illustrations.
Disciplina 004
Accesso persona Mauri, Gian Carlo, editor
Dennunzio, Alberto, editor
Manzoni, Luca, editor
Porreca, Antonio E., editor
Soggetto non controllato Computer science
Computer software
Artificial intelligence
Computer simulation
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Simulation and Modeling
Computational Biology/Bioinformatics
ISBN 9783642390746
3642390749
9783642390739
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers. Asymptotic Dynamics of (Some) Asyncronous Cellular Automata / Enrico Formenti -- Processes Inspired by the Functioning of Living Cells: Natural Computing Approach / Andrzej Ehrenfeucht, Grzegorz Rozenberg -- Regular Papers. On the Power of Threshold Measurements as Oracles / Edwin Beggs, José Félix Costa, Diogo Poças, John V. Tucker -- Size Lower Bounds for Quantum Automata / Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano -- Population Protocols on Graphs: A Hierarchy / Olivier Bournez, Jonas Lefèvre -- Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability / Cristian S. Calude, Kohtaro Tadaki -- On the Power of P Automata / Erzsébet Csuhaj-Varjú, György Vaszil -- Array Insertion and Deletion P Systems / Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K.G. Subramanian -- Boolean Logic Gates from a Single Memristor via Low-Level Sequential Logic / Ella Gale, Ben de Lacy Costello, Andrew Adamatzky -- Light Ray Concentration Reduces the Complexity of the Wavelength-Based Machine on PSPACE Languages / Sama Goliaei, Mohammad-Hadi Foroughmand-Araabi.
Small Steps toward Hypercomputation via Infinitary Machine Proof Verification and Proof Generation / Naveen Sundar Govindarajulu, John Licato, Selmer Bringsjord -- Secure Information Transmission Based on Physical Principles / Dima Grigoriev, Vladimir Shpilrain -- Hypergraph Automata: A Theoretical Model for Patterned Self-assembly / Lila Kari, Steffen Kopecki, Amirhossein Simjour -- Modeling Heart Pacemaker Tissue by a Network of Stochastic Oscillatory Cellular Automata / Danuta Makowiec -- Reaction Systems Made Simple / Luca Manzoni, Antonio E. Porreca -- Voting with a Logarithmic Number of Cards / Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone -- Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes / Jennifer E. Padilla, Matthew J. Patitz, Raul Pena, Robert T. Schweller -- Control Languages Associated with Tissue P Systems / Ajeesh Ramanujan, Kamala Krithivasan -- Geometric Methods for Analysing Quantum Speed Limits: Time-Dependent Controlled Quantum Systems with Constrained Control Functions / Benjamin Russell, Susan Stepney.
Numerical Analysis of Quantum Speed Limits: Controlled Quantum Spin Chain Systems with Constrained Control Functions / Benjamin Russell, Susan Stepney -- Combinatorial Optimization in Pattern Assembly / Shinnosuke Seki -- Towards Computation with Microchemomechanical Systems / Andreas Voigt, Rinaldo Greiner, Merle Allerdißen, Andreas Richter -- Posters. Evolutionary Programming Using Distribution-Based and Differential Mutation Operators / Md. Tanvir Alam Anik, Saif Ahmed -- A P System Parsing Word Derivatives / Artiom Alhazov, Elena Boian, Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahov -- Computational Power of Protein Interaction Networks / Bogdan Aman, Gabriel Ciobanu -- Towards an All-Optical Soliton FFT in the 3NLS-Domain / Anastasios G. Bakaoukas -- Quantum Random Active Element Machine / Michael Stephen Fiske -- Simulating Metabolic Processes Using an Architecture Based on Networks of Bio-inspired Processors / Sandra Gómez Canaval, José Ramón Sánchez, Fernando Arroyo -- On String Reading Stateless Multicounter 5'->3' Watson-Crick Automata / László Hegedüs, Benedek Nagy -- Relating Transition P Systems and Spiking Neural P Systems / Richelle Ann B. Juayong, Nestine Hope S. Hernandez, Francis George C. Cabarle.
Quantum, cellular, molecular, neural, DNA -- membrane, and evolutionary computing.-cellular automata -- computation based on chaos and dynamical systems -- massive parallel computation -- collective intelligence -- computation based on physical principles such as relativistic -- optical, spatial, collision-based computing -- amorphous computing -- physarum computing -- hypercomputation -- fuzzy and rough computing -- swarm intelligence -- artificial immune systems -- physics of computation -- chemical computation -- evolving hardware -- the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.
Record Nr. STANFORD-a10173837
[UCNC (Conference) (12th : 2013 : Milan, Italy)]  
Materiale a stampa
Lo trovi qui: Stanford University
Post-quantum cryptography : 5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings / Philippe Gaborit (eds.).
Post-quantum cryptography : 5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings / Philippe Gaborit (eds.).
Creatore [PQCrypto (Conference) (5th : 2013 : Limoges, France)]
Estensione 1 online resource (x, 258 pages) : illustrations (black and white).
Disciplina 005.8/2
Accesso persona Gaborit, Philippe, editor
Soggetto non controllato Computer science
Data protection
Data encryption (Computer science)
Computer software
Information Systems
Systems and Data Security
Quantum Computing
Management of Computing and Information Systems
Algorithm Analysis and Problem Complexity
ISBN 9783642386169
3642386164
9783642386152
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures / Marco Baldi, Marco Bianchi, Franco Chiaraluce -- Quantum Algorithms for the Subset-Sum Problem / Daniel J. Bernstein, Stacey Jeffery, Tanja Lange -- Improved Lattice-Based Threshold Ring Signature Scheme / Slim Bettaieb, Julien Schrek -- Degree of Regularity for HFEv and HFEv- / Jintai Ding, Bo-Yin Yang -- Software Speed Records for Lattice-Based Signatures / Tim Güneysu, Tobias Oder, Thomas Pöppelmann, Peter Schwabe -- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search / Thijs Laarhoven, Michele Mosca, Joop van de Pol -- An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes / Grégory Landais, Jean-Pierre Tillich -- Extended Algorithm for Solving Underdefined Multivariate Quadratic Equations / Hiroyuki Miura, Yasufumi Hashimoto, Tsuyoshi Takagi -- Quantum Key Distribution in the Classical Authenticated Key Exchange Framework / Michele Mosca, Douglas Stebila, Berkant Ustaoğlu -- Cryptanalysis of Hash-Based Tamed Transformation and Minus Signature Scheme / Xuyun Nie, Zhaohu Xu, Johannes Buchmann -- A Classification of Differential Invariants for Multivariate Post-quantum Cryptosystems / Ray Perlner, Daniel Smith-Tone -- Secure and Anonymous Hybrid Encryption from Coding Theory / Edoardo Persichetti -- Fast Verification for Improved Versions of the UOV and Rainbow Signature Schemes / Albrecht Petzoldt, Stanislav Bulygin, Johannes Buchmann -- The Hardness of Code Equivalence over Fq and Its Application to Code-Based Cryptography / Nicolas Sendrier, Dimitris E. Simos -- Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems / Falko Strenzke -- Simple Matrix Scheme for Encryption / Chengdong Tao, Adama Diene, Shaohua Tang, Jintai Ding -- Multivariate Signature Scheme Using Quadratic Forms / Takanori Yasuda, Tsuyoshi Takagi, Kouichi Sakurai.
Record Nr. STANFORD-a10173850
[PQCrypto (Conference) (5th : 2013 : Limoges, France)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computational science and its applications-- ICCSA 2013 [electronic resource] : 13th International Conference, Ho Chi Minh City, Vietnam, June 24-27, 2013, Proceedings / edited by Beniamino Murgante...[et al.] (eds.).
Computational science and its applications-- ICCSA 2013 [electronic resource] : 13th International Conference, Ho Chi Minh City, Vietnam, June 24-27, 2013, Proceedings / edited by Beniamino Murgante...[et al.] (eds.).
Creatore [ICCSA (Conference) (13th : 2013 : Ho Chi Minh City, Vietnam)]
Estensione 1 online resource (5 v.)
Accesso persona Murgante, Beniamino
Soggetto non controllato Computer science
Computer Communication Networks
Software engineering
Computer software
Data mining
Computer simulation
Algorithm Analysis and Problem Complexity
Simulation and Modeling
Information Systems Applications (incl. Internet)
ISBN 9783642396373 (pt. 1 : electronic bk.)
9783642396434 (pt. 2 : electronic bk.)
9783642396465 (pt. 3 : electronic bk.)
9783642396496 (pt. 4 : electronic bk.)
9783642396403 (pt. 5 : electronic bk.)
3642396372 (pt. 1 : electronic bk.)
3642396437 (pt. 2 : electronic bk.)
3642396461 (pt. 3 : electronic bk.)
3642396496 (pt. 4 : electronic bk.)
3642396402 (pt. 5 : electronic bk.)
9783642396366 (pt. 1)
9783642396427 (pt. 2)
9783642396458 (pt. 3)
9783642396489 (pt. 4)
9783642396397 (pt. 5)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a10191061
[ICCSA (Conference) (13th : 2013 : Ho Chi Minh City, Vietnam)]  
Materiale a stampa
Lo trovi qui: Stanford University
Quality, reliability, security and robustness in heterogeneous networks : 9th International Conference, QShine 2013, Greader Noida, India, January 11-12, 2013, Revised selected papers / Karan Singh, Amit K. Awasthi (eds.).
Quality, reliability, security and robustness in heterogeneous networks : 9th International Conference, QShine 2013, Greader Noida, India, January 11-12, 2013, Revised selected papers / Karan Singh, Amit K. Awasthi (eds.).
Creatore [International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (9th : 2013 : Noida, India)]
Estensione 1 online resource.
Disciplina 004.6
Accesso persona Singh, Karan
Awasthi, Amit K.
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Systems and Data Security
Algorithm Analysis and Problem Complexity
ISBN 9783642379499
3642379494
9783642379482
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto DSG-PC: Dynamic Social Grouping based Routing for Non-uniform Buffer Capacities in DTN with Supported Carriers -- Integrated Approach for Multicast Source Authentication and Congestion Control -- Network Selection for Remote Healthcare Systems through Mapping between Clinical and Network Parameter -- Routing Protocols in Mobile Ad-Hoc Network: A Review -- Comparative Analysis of Contention Based Medium Access Control Protocols for Wireless Sensor Networks -- Mobility based Energy Efficient Coverage Hole Maintenance for Wireless Sensor Network -- Clusterhead Selection using Multiple Attribute Decision Making (MADM) Approach in Wireless Sensor Networks.
Record Nr. STANFORD-a10215717
[International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (9th : 2013 : Noida, India)]  
Materiale a stampa
Lo trovi qui: Stanford University
Wireless algorithms, systems, and applications : 8th International Conference, WASA 2013, Zhangjiajie, China, August 7-10, 2013. Proceedings / Kui Ren, Xue Liu, Weifa Liang, Ming Xu, Xiaohua Jia, Kai Xing (eds.).
Wireless algorithms, systems, and applications : 8th International Conference, WASA 2013, Zhangjiajie, China, August 7-10, 2013. Proceedings / Kui Ren, Xue Liu, Weifa Liang, Ming Xu, Xiaohua Jia, Kai Xing (eds.).
Creatore [WASA (Conference) (8th : 2013 : Zhangjiajie Shi, China)]
Estensione 1 online resource (xiv, 536 pages) : illustrations (black and white).
Disciplina 621.382
Accesso persona Ren, Kui, editor
Liu, Xue, editor
Liang, Weifa, editor
Xu, Ming, editor
Jia, Xiaohua, editor
Xing, Kai, editor
Soggetto non controllato Computer science
Computer Communication Networks
Computer system performance
Computer software
Algorithm Analysis and Problem Complexity
Information Systems Applications (incl. Internet)
System Performance and Evaluation
ISBN 9783642397011
3642397018
9783642397004
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Improving Particle Filter with Better Proposal Distribution for Nonlinear Filtering Problems -- Performance Evaluation with Control Channel on the Coexistence Scenario of TD-LTE and LTE-FDD -- Buffer Occupation in Wireless Social Networks -- Efficient Identity-Based Encryption without Pairings and Key Escrow for Mobile Devices -- A Network Forensics System for Information Leak Events -- Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment -- An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems -- A Novel Delay-Resilient Remote Memory Attestation for Smart Grid -- A Source-Relay Selection Scheme with Power Allocation for Asymmetric Two-Way Relaying Networks in Underground Mines -- Performance Analysis of Broadcast in Multi-channel Multi-radio Wireless Mesh Networks -- SAFE: A Strategy-Proof Auction Mechanism for Multi-radio, Multi-channel Spectrum Allocation -- A Context-Aware MAC Protocol for VANETs -- A Balance Storage Nodes Assignment for Wireless Sensor Networks -- A Trustworthiness Evaluation Method for Wireless Sensor Nodes Based on D-S Evidence Theory -- UCOR: An Unequally Clustering-Based Hierarchical Opportunistic Routing Protocol for WSNs -- A Quadri-Stage Contention MAC Protocol with Opportunistic Network Coding Support for Underwater Acoustic Networks -- Fast Encryption of JPEG 2000 Images in Wireless Multimedia Sensor Networks -- Evaluating Selective ARQ and Slotted Handshake Based Access in Real World Underwater Networks -- ActiviTune: A Multi-stage System for Activity Recognition of Passive Entities from Ambient FM-Radio Signals -- From Decision Fusion to Localization in Radar Sensor Networks: A Game Theoretical View -- Characterizing the Impact of Non-uniform Deployment of APs on Network Performance under Partially Overlapped Channels -- Patient's Motion Recognition Based on SOM-Decision Tree -- Range-Free Mobile Node Localization Using Static Anchor -- Neighbor Discovery Algorithm Based on the Regulation of Duty-Cycle in Mobile Sensor Network -- Diversity between Human Behaviors and Metadata Analysis: A Measurement of Mobile App Recommendation -- An Urban Area-Oriented Improving Particle Filter with Better Proposal Distribution for Nonlinear Filtering Problems -- Performance Evaluation with Control Channel on the Coexistence Scenario of TD-LTE and LTE-FDD -- Buffer Occupation in Wireless Social Networks -- Efficient Identity-Based Encryption without Pairings and Key Escrow for Mobile Devices -- A Network Forensics System for Information Leak Events -- Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment -- An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems -- A Novel Delay-Resilient Remote Memory Attestation for Smart Grid -- A Source-Relay Selection Scheme with Power Allocation for Asymmetric Two-Way Relaying Networks in Underground Mines -- Performance Analysis of Broadcast in Multi-channel Multi-radio Wireless Mesh Networks -- SAFE: A Strategy-Proof Auction Mechanism for Multi-radio, Multi-channel Spectrum Allocation -- A Context-Aware MAC Protocol for VANETs -- A Balance Storage Nodes Assignment for Wireless Sensor Networks -- A Trustworthiness Evaluation Method for Wireless Sensor Nodes Based on D-S Evidence Theory -- UCOR: An Unequally Clustering-Based Hierarchical Opportunistic Routing Protocol for WSNs -- A Quadri-Stage Contention MAC Protocol with Opportunistic Network Coding Support for Underwater Acoustic Networks -- Fast Encryption of JPEG 2000 Images in Wireless Multimedia Sensor Networks -- Evaluating Selective ARQ and Slotted Handshake Based Access in Real World Underwater Networks -- ActiviTune: A Multi-stage System for Activity Recognition of Passive Entities from Ambient FM-Radio Signals -- From Decision Fusion to Localization in Radar Sensor Networks: A Game Theoretical View -- Characterizing the Impact of Non-uniform Deployment of APs on Network Performance under Partially Overlapped Channels -- Patient's Motion Recognition Based on SOM-Decision Tree -- Range-Free Mobile Node Localization Using Static Anchor -- Neighbor Discovery Algorithm Based on the Regulation of Duty-Cycle in Mobile Sensor Network -- Diversity between Human Behaviors and Metadata Analysis: A Measurement of Mobile App Recommendation -- An Urban Area-Oriented Traffic Information Query Strategy in VANETs -- Navigation for Indoor Mobile Robot Based on Wireless Sensor Network -- iMac: Strategy-Proof Incentive Mechanism for Mobile Crowdsourcing -- Social Welfare Maximization in Participatory Smartphone Sensing -- An Optimal Solution for Round Rotation Time Setting in LEACH -- UPC-MAC: A Power Control MAC Protocol for Underwater Sensor Networks -- FMAC for Coexisting Ad Hoc Cognitive Radio Networks -- Effective RSS Sampling for Forensic Wireless Localization -- An Optimal Leakage Detection Strategy for Underground Pipelines Using Magnetic Induction-Based Sensor Networks -- Compressive Data Retrieval with Tunable Accuracy in Vehicular Sensor Networks -- Enforcing Spectrum Access Rules in Cognitive Radio Networks through Cooperative Jamming -- Photo Forensics on Shanzhai Mobile Phone -- Local Information Storage Protocol for Urban Vehicular Networks -- Maximum Independent Set of Links with Power Control -- Sweep-Coverage with Energy-Restricted Mobile Wireless Sensor Nodes -- The Trading between Virtual Mobile Operator and Wireless Service Provider in the Two-Tier Femtocell Network -- Truthful Online Reverse Auction with Flexible Preemption for Access Permission Transaction in Macro-Femtocell Networks -- Social Communications Assisted Epidemic Disease Influence Minimization.
Record Nr. STANFORD-a10215718
[WASA (Conference) (8th : 2013 : Zhangjiajie Shi, China)]  
Materiale a stampa
Lo trovi qui: Stanford University
Cryptographic hardware and embedded systems-- CHES 2013 : 15th International Workshop, Santa Barbara, CA, USA, August 20-23, 2013. Proceedings / Guido Bertoni, Jean-Sébastien Coron (eds.).
Cryptographic hardware and embedded systems-- CHES 2013 : 15th International Workshop, Santa Barbara, CA, USA, August 20-23, 2013. Proceedings / Guido Bertoni, Jean-Sébastien Coron (eds.).
Creatore [CHES (Workshop) (15th : 2013 : Santa Barbara, Calif.)]
Estensione 1 online resource (xiii, 490 pages) : illustrations (black and white).
Disciplina 005.82
Accesso persona Bertoni, Guido, editor
Coron, Jean-Sébastien, editor
Soggetto non controllato Computer science
Data protection
Data encryption (Computer science)
Computer software
Systems and Data Security
Algorithm Analysis and Problem Complexity
ISBN 9783642403491
3642403492
9783642403484
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Side-channel attacks -- Physical unclonable function -- Lightweight cryptography -- Hardware implementations and fault attacks -- Efficient and secure implementations -- Elliptic curve cryptography -- masking -- Side-channel attacks and countermeasures.
Record Nr. STANFORD-a10215852
[CHES (Workshop) (15th : 2013 : Santa Barbara, Calif.)]  
Materiale a stampa
Lo trovi qui: Stanford University
S-BPM ONE - learning by doing - doing by learning : Third International Conference, S-BPM ONE 2011, Ingolstadt, Germany, September 29-30, 2011 : proceedings / Werner Schmidt (ed.).
S-BPM ONE - learning by doing - doing by learning : Third International Conference, S-BPM ONE 2011, Ingolstadt, Germany, September 29-30, 2011 : proceedings / Werner Schmidt (ed.).
Creatore [S BPM-ONE (Conference) (3rd : 2011 : Ingolstadt, Germany)]
Estensione 1 online resource (xiii, 312 pages) : illustrations (some color).
Disciplina 658.4/038
Accesso persona Schmidt, Werner, Prof. Dr. rer. pol.
Soggetto non controllato Computer science
Computer Communication Networks
Software engineering
Computer software
Information storage and retrieval systems
Artificial intelligence
Information Systems Applications (incl. Internet)
Artificial Intelligence (incl. Robotics)
Algorithm Analysis and Problem Complexity
Information Storage and Retrieval
ISBN 9783642234712
3642234712
9783642234705
3642234704
Classificazione 54.69
85.20
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto pt. 1. Educational perspectives -- pt. 2. Methodological advancements -- pt. 3. Technological advancements -- pt. 4. Experience reports.
Record Nr. STANFORD-a9386671
[S BPM-ONE (Conference) (3rd : 2011 : Ingolstadt, Germany)]  
Materiale a stampa
Lo trovi qui: Stanford University