Stem fair$ (all stems)

153 papers:

TACAS-2015-CookKP #infinity

Fairness for Infinite-State Systems (BC, HK, NP), pp. 384–398.

ICEIS-v1-2015-ConstantinonNS #heuristic

Combining Heuristic and Utility Function for Fair Train Crew Rostering (AAC, CFXdMN, AGN, AFdS), pp. 593–602.

KDD-2015-QianCMSL #named #recommendation

SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations (SQ, JC, FLM, IS, ML), pp. 955–964.

RecSys-2015-BistaffaFCR #recommendation #scalability #social

Recommending Fair Payments for Large-Scale Social Ridesharing (FB, AF, GC, SDR), pp. 139–146.

SAC-2015-SaezPCCP #manycore #named #symmetry

ACFS: a completely fair scheduler for asymmetric single-isa multicore systems (JCS, AP, FC, DC, MPM), pp. 2027–2032.

CAV-2015-DietschHLP #approach #ltl #model checking #modulo theories

Fairness Modulo Theory: A New Approach to LTL Software Model Checking (DD, MH, VL, AP), pp. 49–66.

SAT-2015-BurchardSB #parallel #satisfiability

Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.

SIGMOD-2014-LiuH #cost analysis #online #optimisation

Online optimization and fair costing for dynamic data sharing in a cloud data market (ZL, HH), pp. 1359–1370.

STOC-2014-HaitnerT #protocol

An almost-optimally fair three-party coin-flipping protocol (IH, ET), pp. 408–416.

CSCW-2014-FieslerB #online

Remixers’ understandings of fair use online (CF, AB), pp. 1023–1032.

CIKM-2014-GollapudiP #online

Fair Allocation in Online Markets (SG, DP), pp. 1179–1188.

POPL-2014-CaveFPP #programming

Fair reactive programming (AC, FF, PP, BP), pp. 361–372.

SAC-2014-BasuCKVMM #named

PrefRank: fair aggregation of subjective user preferences (AB, JCC, SK, JV, SM, YM), pp. 287–288.

SAC-2014-HajianMPDG

Fair pattern discovery (SH, AM, DP, JDF, FG), pp. 113–120.

ASPLOS-2014-MenychtasSS #performance #scheduling

Disengaged scheduling for fair, protected access to fast computational accelerators (KM, KS, MLS), pp. 301–316.

ASPLOS-2014-ZahediL #multi #named

REF: resource elasticity fairness with sharing incentives for multiprocessors (SMZ, BCL), pp. 145–160.

HPCA-2014-XieTHC #clustering #memory management #throughput

Improving system throughput and fairness simultaneously in shared memory CMP systems via Dynamic Bank Partitioning (MX, DT, KH, XC), pp. 344–355.

PPoPP-2014-RaoZ #performance #scheduling #towards #virtual machine

Towards fair and efficient SMP virtual machine scheduling (JR, XZ), pp. 273–286.

ECSA-2013-GoichonSF

Swap Fairness for Thrashing Mitigation (FG, GS, SF), pp. 311–315.

ICALP-v2-2013-Padovani #type system

Fair Subtyping for Open Session Types (LP), pp. 373–384.

CSCW-2013-LampinenLCS #online

Indebtedness, reciprocity, and fairness in local online exchange (AL, VL, CC, ES), pp. 661–672.

DUXU-WM-2013-TabosaCACD #case study #design #usability

Design and Usability: A Case Study on Selecting Exhibitors for the National Fair of Craftwork — FENEARTE — Recife, PE, Brazil (TT, VC, AA, EC, GD), pp. 121–129.

ICML-c3-2013-ZemelWSPD #learning

Learning Fair Representations (RSZ, YW, KS, TP, CD), pp. 325–333.

KDD-2013-LuB0L #perspective

The bang for the buck: fair competitive viral marketing from the host perspective (WL, FB, AG, LVSL), pp. 928–936.

LOPSTR-2013-AntoyJ #compilation #functional #logic

Compiling a Functional Logic Language: The Fair Scheme (SA, AJ), pp. 202–219.

SAC-2013-KuptsovNGL #metric #network #novel

A novel demand-aware fairness metric for IEEE 802.11 wireless networks (DK, BN, AG, AL), pp. 603–610.

SAC-2013-SimaoV

A progress and profile-driven cloud-VM for resource-efficiency and fairness in e-science environments (JS, LV), pp. 357–362.

HPCA-2013-SubramanianSKJM #in memory #memory management #named #performance #predict

MISE: Providing performance predictability and improving fairness in shared main memory systems (LS, VS, YK, BJ, OM), pp. 639–650.

CASE-2012-SugiyamaNITU #approach #composition #problem

A bilevel decomposition approach to railway crew rostering problems for fair labor condition (TS, TN, MI, ST, KU), pp. 383–389.

DATE-2012-ZhangWHY #algorithm #energy #game studies #resource management

Fair energy resource allocation by minority game algorithm for smart buildings (CZ, WW, HH, HY), pp. 63–68.

ITiCSE-2012-FarrellRFKH #assessment

Capstone project: fair, just and accountable assessment (VF, GR, GF, PK, DH), pp. 168–173.

WRLA-2012-BaeM #locality #model checking

Model Checking LTLR Formulas under Localized Fairness (KB, JM), pp. 99–117.

ICALP-v1-2012-PolacekS #strict

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.

OSDI-2012-ShueFS #multitenancy #performance

Performance Isolation and Fairness for Multi-Tenant Cloud Storage (DS, MJF, AS), pp. 349–362.

CAV-2012-AtigBEL #detection #parallel #source code #thread

Detecting Fair Non-termination in Multithreaded Programs (MFA, AB, ME, AL), pp. 210–226.

CASE-2011-KalyanasundaramLR #combinator #distributed #resource management

Fail-Stop Distributed Combinatorial Auctioning Systems with fair resource allocation (AK, RAKL, SR), pp. 181–188.

ICDAR-2011-LeloreB #algorithm

Super-Resolved Binarization of Text Based on the FAIR Algorithm (TL, FB), pp. 839–843.

FM-2011-ZhangSPLD #on the #reduction

On Combining State Space Reductions with Global Fairness Assumptions (SJZ, JS, JP, YL, JSD), pp. 432–447.

IFL-2011-AmsdenF #transaction

Fairness for Transactional Events (EA, MF), pp. 17–34.

SAC-2011-CederquistD #complexity #constraints

Complexity of fairness constraints for the Dolev-Yao attacker model (JC, MTD), pp. 1502–1509.

CAV-2011-BaeM #ltl #model checking #parametricity

State/Event-Based LTL Model Checking under Parametric Generalized Fairness (KB, JM), pp. 132–148.

ICLP-2011-Campli #framework

A Semiring-based framework for fair resources allocation (PC), pp. 268–273.

SIGMOD-2010-ElmeleegyOEA #integration #peer-to-peer #privacy

Preserving privacy and fairness in peer-to-peer data integration (HE, MO, AKE, AMA), pp. 759–770.

FoSSaCS-2010-AsarinCV #game studies

Fair Adversaries and Randomization in Two-Player Games (EA, RCYF, DV), pp. 64–78.

TACAS-2010-HoenickeOP

Fairness for Dynamic Control (JH, ERO, AP), pp. 251–265.

KR-2010-GiacomoPS #constraints

Generalized Planning with Loops under Strong Fairness Constraints (GDG, FP, SS).

QAPL-2010-BiancoFMM #game studies

Quantitative Fairness Games (AB, MF, FM, AM), pp. 48–63.

ASPLOS-2010-EbrahimiLMP #configuration management #manycore #memory management

Fairness via source throttling: a configurable and high-performance fairness substrate for multi-core memory systems (EE, CJL, OM, YNP), pp. 335–346.

HPDC-2010-YuanYWZ #named #parallel #predict #scheduling #strict

PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling (YY, GY, YW, WZ), pp. 240–251.

CAV-2010-CohenNS #composition #reasoning

A Dash of Fairness for Compositional Reasoning (AC, KSN, YS), pp. 543–557.

VLDB-2009-UMM #algorithm #multi #query

A Fair Assignment Algorithm for Multiple Preference Queries (LHU, NM, KM), pp. 1054–1065.

FoSSaCS-2009-AbbesB #algebra #concurrent #probability

Concurrency, σ-Algebras, and Probabilistic Fairness (SA, AB), pp. 380–394.

ICALP-v2-2009-CooperIKK #graph #random #using

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.

FM-2009-McIverMM #probability #security

Security, Probability and Nearly Fair Coins in the Cryptographers’ Café (AM, LM, CM), pp. 41–71.

FM-2009-SunLRLD #abstraction #model checking #process

Fair Model Checking with Process Counter Abstraction (JS, YL, AR, SL, JSD), pp. 123–139.

HIMI-DIE-2009-LeeKSC #framework #multi #protocol

A Framework for Fairness Guaranteed Multi-streaming Transport Protocol (WL, HK, DWS, JC), pp. 553–562.

AdaEurope-2009-KaiserP #java #multi #semantics #thread

Weak Fairness Semantic Drawbacks in Java Multithreading (CK, JFPP), pp. 90–104.

ESEC-FSE-2009-BirdBADBFD #bias #dataset #debugging

Fair and balanced?: bias in bug-fix datasets (CB, AB, EA, JD, AB, VF, PTD), pp. 121–130.

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.

SOSP-2009-IsardPCWTG #clustering #distributed #named #scheduling

Quincy: fair scheduling for distributed computing clusters (MI, VP, JC, UW, KT, AG), pp. 261–276.

CADE-2009-LudwigH #reasoning

Fair Derivations in Monodic Temporal Reasoning (ML, UH), pp. 261–276.

CAV-2009-SunLDP #flexibility #named #towards #verification

PAT: Towards Flexible Verification under Fairness (JS, YL, JSD, JP), pp. 709–714.

ICLP-2009-CampliB #concurrent #constraints

Capturing Fair Computations on Concurrent Constraint Language (PC, SB), pp. 559–560.

PLDI-2008-MusuvathiQ #model checking

Fair stateless model checking (MM, SQ), pp. 362–371.

STOC-2008-GordonHKL

Complete fairness in secure two-party computation (SDG, CH, JK, YL), pp. 413–422.

CIKM-2008-JonesKPT #privacy

Vanity fair: privacy in querylog bundles (RJ, RK, BP, AT), pp. 853–862.

RE-2008-FinkelsteinHMRZ #analysis #requirements

“Fairness Analysis” in Requirements Assignments (AF, MH, SAM, JR, YZ), pp. 115–124.

STOC-2007-AsadpourS #algorithm #approximate

An approximation algorithm for max-min fair allocation of indivisible goods (AA, AS), pp. 114–121.

OCSC-2007-Jang #community #game studies #online #self

Managing Fairness: Reward Distribution in a Self-organized Online Game Player Community (CYJ), pp. 375–384.

SAC-2007-LeeKS #network #scheduling

A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network (JL, MK, AS), pp. 1131–1135.

STOC-2006-ChoG #distributed #multi #resource management

Pricing for fairness: distributed resource allocation for multiple objectives (SwC, AG), pp. 197–204.

ICALP-v1-2006-FiatKLOS #design #network #on the

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (AF, HK, ML, SO, RS), pp. 608–618.

ICPR-v2-2006-SaraM #invariant #named #recognition #towards

FAIR: Towards A New Feature for Affinely-Invariant Recognition (RS, MM), pp. 412–416.

SEKE-2006-ZhangYLC #formal method #game studies #novel #protocol

A Novel Fairness Property of Electronic Commerce Protocols and Its Game-based Formalization (LZ, JY, ML, JC), pp. 410–415.

LICS-2006-VaraccaV #logic #model checking

Temporal Logics and Model Checking for Fairly Correct Systems (DV, HV), pp. 389–398.

TACAS-2005-PnueliPR #analysis

Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems (AP, AP, AR), pp. 124–139.

ICALP-2005-Zhang #game studies #performance #resource management

The Efficiency and Fairness of a Fixed Budget Resource Allocation Game (LZ0), pp. 485–496.

IFM-2005-BarradasB #fixpoint #semantics

A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions (HRB, DB), pp. 327–346.

EDOC-2005-RobinsonCS #implementation #interactive #web #web service

Implementing Fair Non-repudiable Interactions with Web Services (PR, NC, SKS), pp. 195–206.

POPL-2005-PodelskiR #abstraction #termination

Transition predicate abstraction and fair termination (AP, AR), pp. 132–144.

HPDC-2005-LuJ #design #distributed #effectiveness #evaluation #multi

Design and evaluation of a new and effective fairness scheme for multicasting in Internet-scale distributed systems (YL, HJ), pp. 285–286.

RTA-2005-Meseguer #locality #semantics

Localized Fairness: A Rewriting Semantics (JM), pp. 250–263.

ICALP-2004-KalyanasundaramV

Fairness to All While Downsizing (BK, MV), pp. 819–830.

PPDP-2004-SerranoBS #thread

Scheme fair threads (MS, FB, BPS), pp. 203–214.

SAC-2004-NenadicZB #email

Fair certified e-mail delivery (AN, NZ, SB), pp. 391–396.

SAC-2004-VukadinovicT

RED with Dynamic Thresholds for improved fairness (VV, LT), pp. 371–372.

OSDI-2004-BosBCNP #named #performance

FFPF: Fairly Fast Packet Filters (HB, WdB, MLC, TN, GP), pp. 347–363.

ICEIS-v4-2003-NenadicZ

Non-Repudiation and Fairness in Electronic Data Exchange (AN, NZ), pp. 55–62.

CAV-2003-KestenPP #simulation

Bridging the Gap between Fair Simulation and Trace Inclusion (YK, NP, AP), pp. 381–393.

TACAS-2002-BustanG #simulation

Applicability of Fair Simulation (DB, OG), pp. 401–414.

IFM-2002-BarradasB #liveness #proving #specification

Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems (HRB, DB), pp. 360–379.

ICEIS-2002-Payeras-CapellaFR #named

ITHAKI: Fair N-Transferable Anonymous Cash (MPC, JLFG, LHiR), pp. 900–907.

SEKE-2002-BuonoCJH #visualisation

Analysing data trough visualizations in a web-based trade fair system (PB, MFC, GJ, MH), pp. 579–582.

CAV-2002-GurumurthyBS #simulation

Fair Simulation Minimization (SG, RB, FS), pp. 610–624.

CSL-2002-JurdzinskiKH #probability

Trading Probability for Fairness (MJ, OK, TAH), pp. 292–305.

SAS-2001-BouajjaniCLS #automaton #parametricity

Analyzing Fair Parametric Extended Automata (AB, ACA, YL, MS), pp. 335–355.

ICALP-2001-EtessamiWS #automaton #game studies #reduction #simulation

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.

TACAS-2000-HenzingerR #bisimulation

Fair Bisimulation (TAH, SKR), pp. 299–314.

SAS-2000-Mauborgne #termination

Tree Schemata and Fair Termination (LM), pp. 302–321.

STOC-2000-GoelMP #multi #online #throughput

Combining fairness with throughput: online routing with multiple objectives (AG, AM, SAP), pp. 670–679.

HPDC-2000-SchroderH #evaluation #policy

Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness (BS, MHB), pp. 211–220.

OSDI-2000-ChandraAGS #algorithm #cpu #multi #scheduling #symmetry

Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors (AC, MA, PG, PJS), pp. 45–58.

ITiCSE-1999-Gerhardt-PowalsP #question

The digital millennium copyright act: an international assault on fair use? (JGP, MHP), p. 191.

ICEIS-1999-FanCY

Blind Signatures with Double-Hashes Messages for Fair Electronic Elections and Ownership Claimable Digital Cash (CIF, WKC, YSY), pp. 612–618.

SAC-1999-KesslerH #programming #search-based

Depth-Fair Crossover in Genetic Programming (MK, TH), pp. 319–323.

ESEC-FSE-1999-GiannakopoulouMK #question

Checking Progress with Action Priority: Is it Fair? (DG, JM, JK), pp. 511–527.

ICLP-1999-TickYM #constraints #problem

Finding Fair Allocations for the Coalition Problem with Constraints (ET, RHCY, MJM), pp. 530–544.

DLT-1997-MateescuSY #context-free grammar #decidability

Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.

CAV-1997-GyurisS #model checking #on the fly #symmetry

On-the-Fly Model Checking Under Fairness That Exploits Symmetry (VG, APS), pp. 232–243.

CSL-1997-Moschovakis #concurrent #game studies #recursion #λ-calculus

A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.

TLCA-1997-Raamsdonk

Outermost-Fair Rewriting (FvR), pp. 284–299.

ICALP-1996-Joung #interactive #multi

Characterizing Fairness Implementability for Multiparty Interaction (YJJ), pp. 110–121.

ICML-1996-Baum #towards

Toward a Model of Mind as a Laissez-Faire Economy of Idiots (EBB), pp. 28–36.

CAV-1996-KupfermanV96a #verification

Verification of Fair Transisiton Systems (OK, MYV), pp. 372–382.

ICALP-1995-NatarajanC #testing

Divergence and Fair Testing (VN, RC), pp. 648–659.

CAV-1995-AlurH #composition #liveness #modelling

Local Liveness for Compositional Modeling of Fair Reactive Systems (RA, TAH), pp. 166–179.

CAV-1995-EmersonS #approach #model checking #symmetry

Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach (EAE, APS), pp. 309–324.

CAV-1995-Vardi #approach #synthesis

An Automata-Theoretic Approach to Fair Realizability and Synthesis (MYV), pp. 267–278.

ICALP-1994-AzizSBBS

Equivalences for Fair Kripke Structures (AA, VS, FB, RKB, ALSV), pp. 364–375.

CAV-1994-HojatiMB #graph #using

Improving Language Containment Using Fairness Graphs (RH, RBMT, RKB), pp. 391–403.

LICS-1994-AlurH

Finitary Fairness (RA, TAH), pp. 52–61.

DAC-1993-HojatiSBK #approach #model checking

A Unified Approach to Language Containment and Fair CTL Model Checking (RH, TRS, RKB, RPK), pp. 475–481.

STOC-1993-BaruahCPV #resource management

Proportionate progress: a notion of fairness in resource allocation (SKB, NKC, CGP, DAV), pp. 345–354.

DLT-1993-BreveglieriCCC #parallel

Fair First Languages and Parallel Programme Schemes (LB, AC, CC, SCR), pp. 389–418.

HPDC-1993-DobosiewiczG #named #network #protocol

DSMA: A Fair Capacity-1 Protocol for Gigabit Ring Networks (WD, PG), pp. 92–100.

CAV-1993-HojatiBK #debugging #design #using

BDD-Based Debugging Of Design Using Language Containment and Fair CTL (RH, RKB, RPK), pp. 41–58.

STOC-1992-Safra #automaton #exponential

Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (Extended Abstract) (SS), pp. 275–282.

VDME-1991-1-Goldschlag #formal method

A Mechanical Formalization of Several Fairness Notions (DMG), pp. 125–148.

OOPSLA-1991-AndreoliP #communication #information management

Communication as Fair Distribution of Knowledge (JMA, RP), pp. 212–229.

LICS-1991-KlarlundK #automaton #metric

Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.

RTA-1991-BonacinaH #on the #proving #theorem proving

On Fairness of Completion-Based Theorem Proving Strategies (MPB, JH), pp. 348–360.

POPL-1990-AttieFG #interactive #multi

Fairness and Hyperfairness in Multi-Party Interactions (PCA, NF, OG), pp. 292–305.

CSL-1989-PrieseN #metric #semantics #using

Semantic for Abstract Fairness using Metric Spaces (LP, DN), pp. 355–368.

RTA-1989-Tison #decidability #termination

Fair Termination is Decidable for Ground Systems (ST), pp. 462–476.

CSL-1988-Priese #on the

On the Existence of Fair Schedulers (LP), pp. 272–287.

POPL-1987-AptFK #distributed #programming

Appraising Fairness in Languages for Distributed Programming (KRA, NF, SK), pp. 189–198.

CSL-1987-RehrmannP #equivalence #problem

Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.

STOC-1986-CourcoubetisVW #concurrent #reasoning #source code

Reasoning about Fair Concurrent Programs (CC, MYV, PW), pp. 283–294.

ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #source code #termination

On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.

CADE-1986-PoratF #equation #term rewriting

Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (SP, NF), pp. 21–41.

ICALP-1985-Ben-OrGMR #contract #protocol

A Fair Protocol for Signing Contracts (Extended Abstract) (MBO, OG, SM, RLR), pp. 43–52.

ICALP-1985-Hennessy #algebra #communication #process

An Algebraic Theory of Fair Asynchronous Communicating Processes (MH), pp. 260–269.

RTA-1985-PoratF #term rewriting

Fairness in Term Rewriting Systems (SP, NF), pp. 287–300.

STOC-1984-Hennessy #modelling #process

Modelling Fair Processes (MH), pp. 25–30.

ICALP-1984-Reisig #partial order #semantics

Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.

POPL-1984-FrancezK #termination

Generalized Fair Termination (NF, DK), pp. 46–53.

SLP-1984-ShapiroM84 #concurrent #implementation #prolog #self #specification

Fair, Biased, and Self-Balancing Merge Operators: Their Specification and Implementation in Concurrent Prolog (EYS, CM), pp. 83–90.

STOC-1983-Pnueli #algorithm #on the #probability

On the Extremely Fair Treatment of Probabilistic Algorithms (AP), pp. 278–290.

ICALP-1983-BakkerZ #ada #process #semantics

Processes and a Fair Semantics for the Ada Rendez-Vous (JWdB, JIZ), pp. 52–66.

ICALP-1983-DarondeauK #on the #parallel #semantics

On the Observational Semantics of Fair Parallelism (PD, LK), pp. 147–159.

ICALP-1981-LehmannPS #concurrent #termination

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination (DJL, AP, JS), pp. 264–277.

POPL-1980-GabbayPSS #on the

On the Temporal Basis of Fairness (DMG, AP, SS, JS), pp. 163–173.

ICSE-1976-KarpL #implementation #monitoring #verification

Verification of Fairness in an Implementation of Monitors (RAK, DCL), pp. 40–46.