Search results for "round"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Luciano Lenzini, Beatrice Meini, Enzo Mingozzi, Giovanni Stea	An M/G/1 Queuing System with Multiple Vacations to Assess the Performance of a Simplified Deficit Round Robin Model.	Computer Performance Evaluation / TOOLS	2003	DBLP DOI BibTeX RDF
16	Hao Jiang, Constantinos Dovrolis	Passive estimation of TCP round-trip times.	Comput. Commun. Rev.	2002	DBLP DOI BibTeX RDF	TCP/IP
16	Manoj Prabhakaran 0001, Alon Rosen, Amit Sahai	Concurrent Zero Knowledge with Logarithmic Round-Complexity.	FOCS	2002	DBLP DOI BibTeX RDF
16	Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek 0001	The one-round Voronoi game.	SCG	2002	DBLP DOI BibTeX RDF	Voronoi game, competitive facility location, Voronoi diagram
16	Michael A. Trick	Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling.	PATAT	2002	DBLP DOI BibTeX RDF
16	Omar Bakr, Idit Keidar	Evaluating the running time of a communication round over the internet.	PODC	2002	DBLP DOI BibTeX RDF
16	Cynthia Dwork, Larry J. Stockmeyer	2-round zero knowledge and proof auditors.	STOC	2002	DBLP DOI BibTeX RDF	advice bound, timed protocol, zap, cryptography, zero knowledge, interactive proof systems
16	Subhash Khot	On the power of unique 2-prover 1-round games.	STOC	2002	DBLP DOI BibTeX RDF
16	Subhash Khot	On the Power of Unique 2-Prover 1-Round Games.	CCC	2002	DBLP DOI BibTeX RDF	2-prover games, Hardness of approximation, probabilistically checkable proofs
16	Atsuko Miyaji, Masao Nonaka	Cryptanalysis of the Reduced-Round RC6.	ICICS	2002	DBLP DOI BibTeX RDF
16	Andrea Francini, Fabio M. Chiussi, Robert T. Clancy, Kevin D. Drucker, Nasser E. Idirene	Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks.	QoS-IP	2001	DBLP DOI BibTeX RDF
16	Pawel Chodowiec, Po Khuon, Kris Gaj	Fast implementations of secret-key block ciphers using mixed inner- and outer-round pipelining.	FPGA	2001	DBLP DOI BibTeX RDF	fast architectures, secret-key ciphers, pipelining, AES
16	Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri	Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.	ESA	2001	DBLP DOI BibTeX RDF
16	Pierre-Alain Fouque, Jacques Stern	One Round Threshold Discrete-Log Key Generation without Private Channels.	Public Key Cryptography	2001	DBLP DOI BibTeX RDF	Threshold DLK Generation, Publicly Verifiable Encryption, Adaptive and Concurrent Adversary
16	Ulrich Kühn 0001	Cryptanalysis of Reduced-Round MISTY.	EUROCRYPT	2001	DBLP DOI BibTeX RDF
16	Julio César Hernández Castro, José María Sierra, Arturo Ribagorda, Benjamín Ramos, J. Carlos Mex-Perera	Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers.	IMACC	2001	DBLP DOI BibTeX RDF
16	Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller	One-Round Secure Computation and Secure Autonomous Mobile Agents.	ICALP	2000	DBLP DOI BibTeX RDF
16	William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan	Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.	ICALP	2000	DBLP DOI BibTeX RDF
16	Pham Hong Hanh, Tran Cao Son	Round-Table Architecture for Communication in Multi-agent Softbot Systems.	IDEAL	2000	DBLP DOI BibTeX RDF
16	Jie Wang, Yonatan Levy	Managing Performance Using Weighted Round-Robin.	ISCC	2000	DBLP DOI BibTeX RDF
16	John Kelsey, Tadayoshi Kohno, Bruce Schneier	Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent.	FSE	2000	DBLP DOI BibTeX RDF
16	Eli Biham	Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R).	EUROCRYPT	2000	DBLP DOI BibTeX RDF
16	Wen Li, David Dapeng Zhang, Zhiyong Liu, Xiangzhen Qiao	A Jump and Look All Round Long Range Image Restoration and Its Parallelism.	ICPP Workshops	2000	DBLP DOI BibTeX RDF
16	John Watrous	PSPACE Has Constant-Round Quantum Interactive Proof Systems.	FOCS	1999	DBLP DOI BibTeX RDF	quantum computation, interactive proof systems
16	Trevor N. Yensen, Marios Parperis, Rafik A. Goubran, Ioannis Lambadaris	Echo target determination using acoustic round trip delay for voice over IP conferences.	ISCAS (4)	1999	DBLP DOI BibTeX RDF
16	Andrew E. Johnson 0001, Thomas G. Moher, Stellan Ohlsson, Mark Gillingham	The Round Earth Project: Deep Learning in a Collaborative Virtual World.	VR	1999	DBLP DOI BibTeX RDF
16	Matteo Vaccari, Roland Carl Backhouse	Calculating a Round-Robin Scheduler.	MPC	1998	DBLP DOI BibTeX RDF
16	Karunaharan Ratnam, Ibrahim Matta	Effect of Local Retransmission at Wireless Access Points on the Round Trip Time Estimation of TCP.	Annual Simulation Symposium	1998	DBLP DOI BibTeX RDF	performance evaluation, Internet, congestion control, TCP/IP, transport protocols, flow control, error recovery, Wireless access
16	Takeshi Shimoyama, Toshinobu Kaneko	Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES.	CRYPTO	1998	DBLP DOI BibTeX RDF
16	KyungOh Lee, Heon Young Yeom	Deciding Round Length and Striping Unit Size for Multimedia Servers.	Multimedia Information Systems	1998	DBLP DOI BibTeX RDF
16	Andreas Fasbender, Peter Davis	Measurement, Modelling and Emulation of Internet Round-Trip Delays.	MMB	1995	DBLP DOI BibTeX RDF
16	Eli Biham, Adi Shamir	Differential Cryptanalysis of the Full 16-Round DES.	CRYPTO	1992	DBLP DOI BibTeX RDF
16	Toshiya Itoh, Kouichi Sakurai	On the Complexity of Constant Round ZKIP of Possession of Knowledge.	ASIACRYPT	1991	DBLP DOI BibTeX RDF
16	Dror Lapidot, Adi Shamir	A One-Round, Two-Prover, Zero-Knowledge Protocol for NP.	CRYPTO	1991	DBLP DOI BibTeX RDF
14	Hao Han, Bo Sheng, Chiu C. Tan 0001, Qun Li 0001, Sanglu Lu	A Timing-Based Scheme for Rogue AP Detection.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	Wireless LAN, IEEE 802.11, round trip time, rogue access point
14	Hagit Attiya, Danny Hendler	Time and Space Lower Bounds for Implementations Using k-CAS.	IEEE Trans. Parallel Distributed Syst.	2010	DBLP DOI BibTeX RDF	Compare&swap (CAS), k-compare&swap (k-CAS), conditional synchronization primitives, queue, collect, stack, counter, round complexity
14	Iftach Haitner, Mohammad Mahmoody, David Xiao	A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.	CCC	2010	DBLP DOI BibTeX RDF	sampling protocols, constant-round statistically hiding commitments, black-box lower bounds, collision-resistant hash functions
14	Zbigniew Jerzak, Christof Fetzer	Soft state in publish/subscribe.	DEBS	2009	DBLP DOI BibTeX RDF	upper bound on message transmission delay, routing, publish/subscribe, round-trip time, soft state
14	Tal Mizrahi, Yoram Moses	Continuous Consensus with Failures and Recoveries.	DISC	2008	DBLP DOI BibTeX RDF	Continuous Consensus, Early decision, Process recovery, Round-based computation model, Synchronous message-passing system, Distributed algorithm, Lower bound, Modularity, Consensus, Agreement problem, Common Knowledge, Simultaneity, Omission failures, Process crash failure
14	Xinghui Zhang, Kuan-sheng Zou, Zengqiang Chen 0001, Zhidong Deng	Stability Analysis of AQM Algorithm Based on Generalized Predictive Control.	ICIC (1)	2008	DBLP DOI BibTeX RDF	generalized predictive control (GPC), active queue management (AQM), stability analysis, round trip time, network congestion
14	Soumia Benkrid, Ladjel Bellatreche, Habiba Drias	A Combined Selection of Fragmentation and Allocation Schemes in Parallel Data Warehouses.	DEXA Workshops	2008	DBLP DOI BibTeX RDF	Affinity Algorithm, Genetic Algorithm, Fragmentation, Allocation, Round Robin
14	Yuki Hayashi, Tomoko Kojiri, Toyohide Watanabe	Focus Support Interface Based on Collaborative Learning Activity.	KES (1)	2008	DBLP DOI BibTeX RDF	Round-table interface, Focusing target, Awareness, CSCL, Learning activity
14	Aggelos Ioannou, Manolis Katevenis	Pipelined heap (priority queue) management for advanced scheduling in high-speed networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	high-speed network scheduling, pipelined hard-ware heap, synthesizable core, weighted fair queueing, priority queue, weighted round robin
14	Lothrop Mittenthal	Sequencings and Directed Graphs with Applications to Cryptography.	SSC	2007	DBLP DOI BibTeX RDF	Block encryption, Complete Latin square, Directed terrace, Inter-round mixing, Quick trickle permutation, Sequenceable group, S/P network, Directed graph, Sequencing
14	Xin Wang 0002, Xiaochen Zhang, Shuang Yang, Xiangyang Xue	Design of a Fairness Guarantee Mechanism Based on Network Measurement.	HASE	2007	DBLP DOI BibTeX RDF	Round Trip Time (RTT), real-time business, fairness
14	Chahé Adourian, Hans Vangheluwe	Consistency between geometric and dynamic views of a mechanical system.	SCSC	2007	DBLP BibTeX RDF	concurrent model evolution, multi-view model consistency, simulation, CAD, triple graph grammars, round-trip engineering
14	Evtim Peytchev, Mohamed Khalil	Optimizing the architecture of distributed shared memory systems in real time applicatons.	CompSysTech	2007	DBLP DOI BibTeX RDF	intermediate server, optimization, distributed computing, heuristic, round-trip time
14	David Raz, Hanoch Levy, Benjamin Avi-Itzhak	The twin measure for queueing system predictability.	VALUETOOLS	2007	DBLP DOI BibTeX RDF	LCFS, LJF, LRPT, SJF, queue disciplines, twin measure, predictability, job scheduling, processor sharing, round robin, SRPT, FCFS, LAS, PS
14	Rupinder Gill, Jason Smith 0001, Andrew J. Clark	Experiences in passively detecting session hijacking attacks in IEEE 802.11 networks.	ACSW	2006	DBLP BibTeX RDF	session hi-jacking, wireless intrusion detection, round trip time, received signal strength, passive monitoring
14	Kwan-Wu Chin	T2-fair: a two-tiered time and throughput fair scheduler for multi-rate WLANs.	MSWiM	2006	DBLP DOI BibTeX RDF	wireless fair queueing, scheduling, QoS, wireless LANs, multi-rate, deficit round robin
14	Xiang Li, Xiaozong Yang	A Sniff Scheduling Policy for Power Saving in Bluetooth Piconet.	ICPADS (1)	2005	DBLP DOI BibTeX RDF	Sniff Mode, time slot, Bluetooth, Piconet, Round Robin
14	Philippe Raipin Parvédy, Michel Raynal	Optimal early stopping uniform consensus in synchronous systems with process omission failures.	SPAA	2004	DBLP DOI BibTeX RDF	round-based computation, send omission, send/receive omission, uniform consensus, consensus, crash failure, omission failure, synchronous distributed system
14	Darryl Veitch, Satish Babu Korada, Attila Pásztor	Robust synchronization of software clocks across the internet.	Internet Measurement Conference	2004	DBLP DOI BibTeX RDF	software clock, synchronization, timing, GPS, network measurement, round-trip time, NTP
14	Thomas W. Reps, Louis B. Rall	Computational Divided Differencing and Divided-Difference Arithmetics.	High. Order Symb. Comput.	2003	DBLP DOI BibTeX RDF	computational differentiation, interpolation, program transformation, multivariate interpolation, round-off error, divided differences
14	Dino Oliva, Rainer Buchty, Nevin Heintze	AES and the cryptonite crypto processor.	CASES	2003	DBLP DOI BibTeX RDF	round key generation, architecture, cryptography, AES, processor, high-speed, software implementation, high-bandwidth
14	Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg	MST construction in O(log log n) communication rounds.	SPAA	2003	DBLP DOI BibTeX RDF	communication round complexity, sub-logarithmic protocols, minimum spanning tree
14	Venkatesan Guruswami, Daniel Lewin 0001, Madhu Sudan 0001, Luca Trevisan	A Tight Characterization of NP with 3 Query PCPs.	FOCS	1998	DBLP DOI BibTeX RDF	Probabilistically Checkable Proofs (PCP), Proof composition, Two-prover one-round proof systems, Adaptive and non-adaptive verifiers, Completeness and soundness, Complexity Theory, Query complexity
14	PeiZong Lee, Fang-Yu Huang, Chorng-Yuan Huang, Hwann-Tzong Chen	Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money.	SAC	1996	DBLP DOI BibTeX RDF	first fit, object-oriented concept, spiral round robin, subset sum, bucket sort
14	Manindra Agrawal, Thomas Thierauf	The Boolean Isomorphism Problem.	FOCS	1996	DBLP DOI BibTeX RDF	Boolean isomorphism problem, one-round interactive proof, NP oracle, computational complexity, computational complexity, learning theory, Boolean formulas, polynomial hierarchy, equivalence queries
14	Carsten Rössner, Jean-Pierre Seifert	Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard.	MFCS	1996	DBLP DOI BibTeX RDF	2-prover 1-round interactive proof-systems, computational complexity, approximation algorithm, NP-hard, probabilistically checkable proofs, Diophantine approximation
14	David M. Lewis	Interleaved Memory Function Interpolators with Application to an Accurate LNS Arithmetic Unit.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	read-only storage, interleaved memory function interpolators, accurate LNS arithmetic unit, accuracy requirements, round to nearest, 91 kbit, interpolation, digital arithmetic, polynomials, error analysis, floating point, approximation theory, ROM, polynomial interpolation, 32 bit, storage requirements
14	Philip J. Bernhard	Bounds on the Performance of Message Routing Heuristics.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	message routing heuristics, communication conflicts, minimum round partitioning problem, performance evaluation, performance, computational complexity, heuristics, lower bounds, message passing, multiprocessor interconnection networks, upper bounds, network routing, omega network, message patterns, conflict-free
14	Charles B. Silio Jr., Hatem M. Ghafir, Manish R. Parikh	An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	PLAYTHROUGH rings, average message queuing time, control frame round trip time, ring-topology local area networks, PLAYTHROUGH protocol, data link layer medium access control protocol, concurrent transfer, multiple messages, queuing system model, multiserver circuit-switched ring, symmetric traffic, shortest outbound distance, performance evaluation, performance analysis, protocols, throughput, local area networks, queueing theory, simulation results, waiting times, circuit switching, approximate method, service time
14	Oded Goldreich 0001, Erez Petrank	Quantifying Knowledge Complexity	FOCS	1991	DBLP DOI BibTeX RDF	constant round AM proofs, knowledge complexity, inclusion results, separation results, Hint sense, computational complexity, languages, proof system
14	Dror Lapidot, Adi Shamir	Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	one-round perfect zero-knowledge protocol, fully parallelized multi prover protocols, NEXP-time, language, parallel executions
14	Richard H. Bartels, Gene H. Golub	Algorithm 350: simplex method procedure employing Lu decomposition [H].	Commun. ACM	1969	DBLP DOI BibTeX RDF	computational stability, linear programming, simplex method, LU decomposition, round-off errors
10	Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin	Finding mobile data under delay constraints with searching costs.	PODC	2010	DBLP DOI BibTeX RDF	partitioning and scheduling, approximation algorithms, design and analysis of algorithms
10	Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen	On the theoretical gap between synchronous and asynchronous MPC protocols.	PODC	2010	DBLP DOI BibTeX RDF	cryptography, multi-party computation, asynchronous network, mpc
10	Saurav Pandit, Sriram V. Pemmaraju	Rapid randomized pruning for fast greedy distributed algorithms.	PODC	2010	DBLP DOI BibTeX RDF	distributed algorithms, randomized algorithms, greedy algorithms, facility location, primal-dual algorithms, minimum dominating set
10	Liz Ribe-Baumann, Kai-Uwe Sattler	A small-world DHT built on generalized network coordinates.	EDBT/ICDT Workshops	2010	DBLP DOI BibTeX RDF
10	Reetuparna Das, Onur Mutlu, Thomas Moscibroda, Chita R. Das	Aérgia: exploiting packet latency slack in on-chip networks.	ISCA	2010	DBLP DOI BibTeX RDF	multi-core, packet scheduling, memory systems, arbitration, prioritization, on-chip networks
10	Arne Vater, Christian Schindelhauer, Christian Ortolf	Tree network coding for peer-to-peer networks.	SPAA	2010	DBLP DOI BibTeX RDF	peer-to-peer networks, network coding, bittorrent
10	Huei-Wen Ferng, Han-Yu Liau	Design of Fair Scheduling Schemes for the QoS-Oriented Wireless LAN.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF
10	Amir Gourgy, Ted H. Szymanski	Cooperative Token-Ring Scheduling For Input-Queued Switches.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
10	Lotfi Mhamdi	On the Integration of Unicast and Multicast Cell Scheduling in Buffered Crossbar Switches.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
10	Jens C. Huhn, Eyke Hüllermeier	FR3: A Fuzzy Rule Learner for Inducing Reliable Classifiers.	IEEE Trans. Fuzzy Syst.	2009	DBLP DOI BibTeX RDF
10	Benjamin Rossman	Ehrenfeucht-Fraïssé Games on Random Structures.	WoLLIC	2009	DBLP DOI BibTeX RDF
10	Davood Rafiei, Andrei Z. Broder, Edward Y. Chang, Patrick Pantel	Information extraction meets relation databases.	CIKM	2009	DBLP DOI BibTeX RDF	relational databases, information extraction
10	Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Information Theoretically Secure Multi Party Set Intersection Re-visited.	Selected Areas in Cryptography	2009	DBLP DOI BibTeX RDF	Information Theoretic Security, Multiparty Computation
10	Vishal Hiremath, Robert W. Proctor, Richard O. Fanjoy, Robert G. Feyen, John P. Young	Comparison of Pilot Recovery and Response Times in Two Types of Cockpits.	HCI (9)	2009	DBLP DOI BibTeX RDF	glass cockpits, digital displays, analog displays, displays, aviation
10	Jay Chen, Lakshminarayanan Subramanian, Jinyang Li 0001	RuralCafe: web search in the rural developing world.	WWW	2009	DBLP DOI BibTeX RDF	intermittent network, low bandwidth, world wide web, web search
10	Dariusz R. Kowalski, Andrzej Pelc	Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps.	ICALP (2)	2009	DBLP DOI BibTeX RDF
10	Valerie King, Jared Saia	From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits.	DISC	2009	DBLP DOI BibTeX RDF
10	Ryad Benadjila, Olivier Billet, Shay Gueron, Matthew J. B. Robshaw	The Intel AES Instructions Set and the SHA-3 Candidates.	ASIACRYPT	2009	DBLP DOI BibTeX RDF
10	Hoeteck Wee	Zero Knowledge in the Random Oracle Model, Revisited.	ASIACRYPT	2009	DBLP DOI BibTeX RDF	sequential composition, zero-knowledge, obfuscation, random oracle model
10	Ke Sun 0001, Shikui Tu, David Yang Gao, Lei Xu 0001	Canonical Dual Approach to Binary Factor Analysis.	ICA	2009	DBLP DOI BibTeX RDF
10	Mario Lamberger, Florian Mendel	Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n.	ISC	2009	DBLP DOI BibTeX RDF	Blender, DCH, Hash functions, collision attacks, preimage attacks, SHA-3
10	Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins	Characterizing truthful multi-armed bandit mechanisms: extended abstract.	EC	2009	DBLP DOI BibTeX RDF	single-parameter auctions, mechanism design, online learning, multi-armed bandits, truthful mechanisms
10	Shaili Jain, Yiling Chen 0001, David C. Parkes	Designing incentives for online question and answer forums.	EC	2009	DBLP DOI BibTeX RDF	question and answer forums, game theory, social computing
10	Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg	Multidimensional Extension of Matsui's Algorithm 2.	FSE	2009	DBLP DOI BibTeX RDF
10	Qianhong Wu, Yi Mu 0001, Willy Susilo, Bo Qin, Josep Domingo-Ferrer	Asymmetric Group Key Agreement.	EUROCRYPT	2009	DBLP DOI BibTeX RDF
10	Valerie King, Jared Saia	Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary.	PODC	2009	DBLP DOI BibTeX RDF	asychrony, communication complexity, gossiping, leader election, byzantine agreement, message complexity, synchrony
10	Orr Dunkelman, Ewan Fleischmann, Michael Gorski, Stefan Lucks	Related-Key Rectangle Attack of the Full HAS-160 Encryption Mode.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	HAS-160, differential cryptanalysis, related-key rectangle attack
10	Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan	Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
10	Joana Treger, Jacques Patarin	Generic Attacks on Feistel Networks with Internal Permutations.	AFRICACRYPT	2009	DBLP DOI BibTeX RDF
10	Marine Minier, Raphael C.-W. Phan, Benjamin Pousse	Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks.	AFRICACRYPT	2009	DBLP DOI BibTeX RDF	known-key distinguishers, cryptanalysis, Block ciphers, Rijndael
10	Jens Groth	Linear Algebra with Sub-linear Zero-Knowledge Arguments.	CRYPTO	2009	DBLP DOI BibTeX RDF	Sub-linear size zero-knowledge arguments, public-coin special honest verifier zero-knowledge, Pedersen commitments, linear algebra, circuit satisfiability
10	Matthieu Rivain	Differential Fault Analysis on DES Middle Rounds.	CHES	2009	DBLP DOI BibTeX RDF
10	Christian Ortolf, Christian Schindelhauer, Arne Vater	Classifying peer-to-peer network coding schemes.	SPAA	2009	DBLP DOI BibTeX RDF	peer-to-peer networks, network coding, bittorrent
10	Mario Aldea Rivas, Michael González Harbour, José F. Ruiz	Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT.	Ada-Europe	2009	DBLP DOI BibTeX RDF	Scheduling, Real-Time Systems, Compilers, POSIX, Ada 2005