## Stem round$ (all stems)

### 90 papers:

- DAC-2015-FernandezJAQVC #bound #realtime
- Increasing confidence on measurement-based contention bounds for real-time round-robin buses (GF, JJ, JA, EQ, TV, FJC), p. 6.
- STOC-2015-ChawlaMSY #algorithm #clustering #graph
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
- STOC-2015-Nikolov #problem #random
- Randomized Rounding for the Largest Simplex Problem (AN), pp. 861–870.
- FM-2015-SolovyevJRG #estimation #fault #float
- Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions (AS, CJ, ZR, GG), pp. 532–550.
- KDD-2015-LinLC #framework #multi #network #social
- A Learning-based Framework to Handle Multi-round Multi-party Influence Maximization on Social Networks (SCL, SDL, MSC), pp. 695–704.
- STOC-2014-BarakKS
- Rounding sum-of-squares relaxations (BB, JAK, DS), pp. 31–40.
- ICALP-v1-2014-BravermanG #bound
- Public vs Private Coin in Bounded-Round Information (MB, AG), pp. 502–513.
- CBSE-2013-CiccozziSCS #assessment #automation #component #deployment #embedded #towards
- An automated round-trip support towards deployment assessment in component-based embedded systems (FC, MS, AC, MS), pp. 179–188.
- ASE-2013-ZhangCW #concurrent #data type #named #runtime
- Round-up: Runtime checking quasi linearizability of concurrent data structures (LZ, AC, CW), pp. 4–14.
- STOC-2013-NaorRV #commutative #difference #performance
- Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.
- ICALP-v1-2013-BravermanRWY
- Direct Product via Round-Preserving Compression (MB, AR, OW, AY), pp. 232–243.
- ICML-c1-2013-ChevaleyreKZ #classification #linear
- Rounding Methods for Discrete Linear Classification (YC, FK, JDZ), pp. 651–659.
- KDIR-KMIS-2013-SilvaPS #education
- A Decision Support System for Portuguese Higher Education Course Selection — First Round (JPS, FP, MFS), pp. 360–367.
- ICALP-v1-2012-ByrkaR #algorithm #approximate
- Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location (JB, BR), pp. 157–169.
- ICALP-v1-2012-CharikarL #approach #problem
- A Dependent LP-Rounding Approach for the k-Median Problem (MC, SL), pp. 194–205.
- ICALP-v1-2012-DeshpandeKS
- Zero-One Rounding of Singular Vectors (AD, RK, NS), pp. 278–289.
- ICALP-v1-2012-LaekhanukitGS #approach #problem
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.
- ICALP-v2-2012-KrystaV #design #on the fly #online #random
- Online Mechanism Design (Randomized Rounding on the Fly) (PK, BV), pp. 636–647.
- ASE-2011-HidakaHIKN #bidirectional #framework #model transformation #named
- GRoundTram: An integrated framework for developing well-behaved bidirectional model transformations (SH, ZH, KI, HK, KN), pp. 480–483.
- FoSSaCS-2011-GhicaM #abstraction #game studies #semantics
- Synchronous Game Semantics via Round Abstraction (DRG, MNM), pp. 350–364.
- STOC-2011-Goyal #constant #protocol #using
- Constant round non-malleable protocols using one way functions (VG), pp. 695–704.
- STOC-2011-LinP
- Constant-round non-malleable commitments from any one-way function (HL, RP), pp. 705–714.
- ICMT-2011-SasanoHHIKN #atl #bidirectional #towards
- Toward Bidirectionalization of ATL with GRoundTram (IS, ZH, SH, KI, HK, KN), pp. 138–151.
- DAC-2010-HaquePJP #approach #embedded #named #performance #policy #simulation
- SCUD: a fast single-pass L1 cache simulation approach for embedded processors with round-robin replacement policy (MSH, JP, AJ, SP), pp. 356–361.
- STOC-2010-GoyalJ #complexity #on the
- On the round complexity of covert computation (VG, AJ), pp. 191–200.
- OOPSLA-2010-KouP #hardware #object-oriented #question
- From OO to FPGA: fitting round objects into square hardware? (SK, JP), pp. 109–124.
- STOC-2009-FriedrichS #random
- Near-perfect load balancing by randomized rounding (TF, TS), pp. 121–130.
- ECMDA-FA-2009-SadovykhVGHGE #on the
- On Study Results: Round Trip Engineering of Space Systems (AS, LV, EG, AH, JG, OE), pp. 265–276.
- ICMT-2009-HettelLR #abduction #approach #towards
- Towards Model Round-Trip Engineering: An Abductive Approach (TH, ML, KR), pp. 100–115.
- PPoPP-2009-LiBH #distributed #multi #performance #scalability #scheduling #using
- Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin (TL, DPB, SH), pp. 65–74.
- DATE-2008-BatcherW #embedded #scheduling
- Dynamic Round-Robin Task Scheduling to Reduce Cache Misses for Embedded Systems (KWB, RAW), pp. 260–263.
- DocEng-2008-Bulcao-NetoGM #prototype
- A prototype documenter system for medical grand rounds (RBN, JACG, AAM), pp. 104–105.
- ICALP-C-2008-KatzKK #complexity #network
- Improving the Round Complexity of VSS in Point-to-Point Networks (JK, CYK, RK), pp. 499–510.
- ICALP-C-2008-OstrovskyPV #concurrent
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (RO, GP, IV), pp. 548–559.
- CAiSE-2008-AnHS #concept #maintenance
- Round-Trip Engineering for Maintaining Conceptual-Relational Mappings (YA, XH, IYS), pp. 296–311.
- ICEIS-ISAS2-2008-ImazekiTD #modelling #web
- Round-Trip Engineering of Web Applications Focusing on Dynamic Models (YI, ST, ND), pp. 228–233.
- ICML-2008-RavikumarAW #convergence #linear #message passing #source code
- Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes (PDR, AA, MJW), pp. 800–807.
- ICMT-2008-HettelLR
- Model Synchronisation: Definitions for Round-Trip Engineering (TH, ML, KR), pp. 31–45.
- SAC-2008-NetoSMAWG #experience #ubiquitous
- Supporting ethnographic studies of ubiquitous computing in the medical grand round experience (RBN, AKS, AAM, PAM, LWA, JACG), pp. 1642–1646.
- ICSE-2008-LiW #maintenance #user interface
- Dynamic round-trip GUI maintenance (PL, EW), pp. 851–854.
- ICALP-2007-DedicM #database #query
- Constant-Round Private Database Queries (ND, PM), pp. 255–266.
- ICSE-2007-ChalabineK #aspect-oriented #automation #framework #re-engineering #weaving
- A Formal Framework for Automated Round-Trip Software Engineering in Static Aspect Weaving and Transformations (MC, CWK), pp. 137–146.
- ASE-2006-Antkiewicz #modelling #using
- Round-Trip Engineering of Framework-Based Software using Framework-Specific Modeling Languages (MA), pp. 323–326.
- ASE-2006-ChalabineKB #aspect-oriented #automation #re-engineering #weaving
- Automated Round-trip Software Engineering in Aspect Weaving Systems (MC, CWK, PB), pp. 305–308.
- STOC-2006-Ben-OrPV
- Byzantine agreement in the full-information model in O(log n) rounds (MBO, EP, VV), pp. 179–186.
- CHI-2006-EsbjornssonBJNOL #design
- Watching the cars go round and round: designing for active spectating (ME, BATB, OJ, DN, MÖ, EL), pp. 1221–1224.
- MoDELS-2006-AntkiewiczC #modelling
- Framework-Specific Modeling Languages with Round-Trip Engineering (MA, KC), pp. 692–706.
- MoDELS-2006-AntkiewiczC #modelling
- Framework-Specific Modeling Languages with Round-Trip Engineering (MA, KC), pp. 692–706.
- SAC-2006-ErshovNM #architecture #precise
- Quad and correctly rounded double precision math functions: portable and optimized for Intel architectures (AE, AN, SM), pp. 1310–1317.
- STOC-2005-SanghviV #complexity #random
- The round complexity of two-party random selection (SS, SPV), pp. 338–347.
- ICALP-2005-PersianoV #concurrent #constant
- Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds (GP, IV), pp. 228–240.
- ICALP-2005-Wee #on the
- On Round-Efficient Argument Systems (HW), pp. 140–152.
- ECMDA-FA-2005-ChiversP #bidirectional #named
- XRound: Bidirectional Transformations and Unifications Via a Reversible Template Language (HC, RFP), pp. 205–219.
- MoDELS-2005-PaesschenMD #named
- SelfSync: A Dynamic Round-Trip Engineering Environment (EVP, WDM, MD), pp. 633–647.
- MoDELS-2005-PaesschenMD #named
- SelfSync: A Dynamic Round-Trip Engineering Environment (EVP, WDM, MD), pp. 633–647.
- GTTSE-2005-LammelM
- Mappings Make Data Processing Go ’Round (RL, EM), pp. 169–218.
- AdaEurope-2003-BurnsHW #ada #policy #scheduling
- A Round Robin Scheduling Policy for Ada (AB, MGH, AJW), pp. 334–343.
- STOC-2002-Charikar #algorithm #estimation #similarity
- Similarity estimation techniques from rounding algorithms (MC), pp. 380–388.
- STOC-2002-DworkS #proving
- 2-round zero knowledge and proof auditors (CD, LJS), pp. 322–331.
- STOC-2002-Khot02a #game studies #on the #power of
- On the power of unique 2-prover 1-round games (SK), pp. 767–775.
- ICALP-2002-IshaiK
- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.
- STOC-2001-CanettiKPR #black box #concurrent
- Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
- STOC-2001-GennaroIKR #complexity #multi
- The round complexity of verifiable secret sharing and secure multicast (RG, YI, EK, TR), pp. 580–589.
- STOC-2001-KilianP #concurrent
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (JK, EP), pp. 560–569.
- ICALP-2001-Baum-Waidner #contract #multi
- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds (BBW), pp. 898–911.
- ICALP-2001-FeigeL #source code
- The RPR2 Rounding Technique for Semidefinite Programs (UF, ML), pp. 213–224.
- ICALP-2001-SadakaneTT #algorithm #combinator #sequence
- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence (KS, NTC, TT), pp. 166–177.
- ICML-2001-Furnkranz #learning
- Round Robin Rule Learning (JF), pp. 146–153.
- ICALP-2000-AielloBOR #performance #proving #verification
- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.
- ICALP-2000-Baum-WaidnerW #contract #multi
- Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing (BBW, MW), pp. 524–535.
- ICALP-2000-CachinCKM #mobile
- One-Round Secure Computation and Secure Autonomous Mobile Agents (CC, JC, JK, JM), pp. 512–523.
- STOC-1999-KargerKSTY #algorithm #geometry #multi
- Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
- STOC-1999-Zwick99a #problem #programming
- Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.
- UML-1999-DemeyerDT #uml #why
- Why Unified is not Universal? UML Shortcomings for Coping with Round-trip Engineering (SD, SD, ST), pp. 630–644.
- ICSE-1999-SchaferZ #c++ #design pattern #java #uml
- Round-Trip Engineering with Design Patterns, UML, Java and C++ (WS, AZ), pp. 683–684.
- ICLP-1999-Henz #constraints
- Constraint-based Round Robin Tournament Planning (MH), pp. 545–557.
- STOC-1998-CharikarCGG #algorithm #approximate
- Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
- STOC-1996-NewmanS #communication #game studies
- Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) (IN, MS), pp. 561–570.
- ICPR-1996-KobatakeM #adaptation #detection
- Adaptive filter to detect rounded convex regions: iris filter (HK, MM), pp. 340–344.
- STOC-1995-KremerNR #communication #complexity #on the #random
- On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
- STOC-1993-GarayM #polynomial
- Fully polynomial Byzantine agreement in t+1 rounds (JAG, YM), pp. 31–41.
- STOC-1992-FeigeL92a #problem #proving
- Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) (UF, LL), pp. 733–744.
- STOC-1991-NisanW #communication #complexity #revisited
- Rounds in Communication Complexity Revisited (NN, AW), pp. 419–429.
- STOC-1990-BeaverMR #complexity #protocol
- The Round Complexity of Secure Protocols (Extended Abstract) (DB, SM, PR), pp. 503–513.
- STOC-1990-BellareMO #constant
- Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.
- CSL-1990-HertrampfW #bound #fault #interactive #proving
- Interactive Proof Systems: Provers, Rounds, and Error Bounds (UH, KWW), pp. 261–273.
- ICALP-1989-BrassardC #bound
- Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.
- ECOOP-1988-TsichritzisN #database
- Fitting Round Objects into Square Databases (DT, ON), pp. 283–299.
- STOC-1985-Alon #sorting
- Expanders, Sorting in Rounds and Superconcentrators of Limited Depth (NA), pp. 98–102.
- STOC-1985-Bracha #protocol #random
- An O(lg n) Expected Rounds Randomized Byzantine Generals Protocol (GB), pp. 316–326.