19. majKære skriftlig censor i samfundsfag Her er brev nr. 1 vedr. skriftlig prøve i samfundsfag 2014, som også lægges på http://www.uvm.dk/Uddannelser-og-dagtilbud/Gymnasiale-uddannelser/Information-til-cens

Source URL: www.uvm.dk

Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL

Source URL: cs-www.cs.yale.edu

• Analysis of algorithms
• Algorithm
• Time complexity
• Randomized algorithm
• Adversary model
• Consensus
• Distributed computing
• Complexity
• Quantum algorithm
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

A Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity JAMES ASPNES, Yale University HAGIT ATTIYA, Technion KEREN CENSOR-HILLEL, Technion FAITH ELLEN, University of Toronto

Source URL: cs-www.cs.yale.edu

• Pointer
• Computing
• Data management
• Computer programming
• Concurrency control
• Linearizability
• Transaction processing

Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel†

Source URL: cs-www.cs.yale.edu

• Computing
• Tree
• B-tree
• Tango tree
• Sethi–Ullman algorithm
• Binary trees
• Graph theory
• Data management

Lower Bounds for Restricted-Use Objects James Aspnes∗ Keren Censor-Hillel† Hagit Attiya‡

Source URL: cs-www.cs.yale.edu

• Analysis of algorithms
• Time complexity
• Big O notation
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Ansøgning om Ad Hoc-beskikkelse som Censor i Fysik Vejledning: Ifølge Eksamensbekendtgørelsen kapitel 9 §56 kan censorformandskabet ” i særlige tilfælde beskikke censorer til enkeltstående censuropgaver” (såk

Source URL: phys.medarbejdere.au.dk

THE COWLEY COUNTY CENSOR VOLUME 1. NUMBER 19 WINFIELD, COWLEY COUNTY, KANSAS, JANUARY 7, 1871 (Communicated) TO THE WORLD AND BUTLER COUNTY,

Source URL: www.ausbcomp.com

Partial Information Spreading with Application to Distributed Maximum Coverage Keren Censor Hillel∗ and Hadas Shachnai† Department of Computer Science, Technion Haifa 32000, Israel February 18, 2010

Source URL: www.cs.technion.ac.il

• Probability theory
• Algebraic graph theory
• Network flow
• Conductance
• Matrices
• Connectivity
• Randomized algorithm
• Degree
• Flow network
• Graph theory
• Mathematics
• Theoretical computer science

FAST INFORMATION SPREADING IN GRAPHS WITH LARGE WEAK CONDUCTANCE∗ KEREN CENSOR-HILLEL† AND HADAS SHACHNAI‡ Abstract. Gathering data from nodes in a network is at the heart of many distributed applications, most not

Source URL: www.cs.technion.ac.il

• Algebraic graph theory
• Probability theory
• Network flow
• Network theory
• Conductance
• Flow network
• Connectivity
• Graph
• Centrality
• Graph theory
• Mathematics
• Theoretical computer science

Structuring Unreliable Radio Networks ∗ Keren Censor-Hillel Computer Science and

Source URL: www.comp.nus.edu.sg

• Distributed algorithms
• Algorithms
• Mathematics
• Applied mathematics
• Fault-tolerant computer systems