60 papers:
DAC-2015-KoJKLS #design #guidelines- Guidelines to design parity protected write-back L1 data cache (YK, RJ, YK, KL, AS), p. 6.
FoSSaCS-2015-Ganardi #bound #clique #game studies- Parity Games of Bounded Tree- and Clique-Width (MG), pp. 390–404.
ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
- FoSSaCS-2014-Chatterjee0GO #game studies #probability
- Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
- FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability
- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
- ICALP-v1-2014-AaronsonABB
- Weak Parity (SA, AA, KB, MB), pp. 26–38.
GRAPHITE-2014-KantP #game studies #generative- Generating and Solving Symbolic Parity Games (GK, JvdP), pp. 2–14.
ICML-c1-2014-ErmonGSS #constraints #integration- Low-density Parity Constraints for Hashing-Based Discrete Integration (SE, CPG, AS, BS), pp. 271–279.
DATE-2013-ManiatakosMM #array #memory management #optimisation- AVF-driven parity optimization for MBU protection of in-core memory arrays (MM, MKM, YM), pp. 1480–1485.
- FoSSaCS-2013-HuthKP #game studies
- Fatal Attractors in Parity Games (MH, JHPK, NP), pp. 34–49.
LICS-2013-NainV #game studies #probability- Solving Partial-Information Stochastic Parity Games (SN, MYV), pp. 341–348.
- FoSSaCS-2012-Chatterjee #concurrent #game studies #robust
- Robustness of Structurally Equivalent Concurrent Parity Games (KC), pp. 270–285.
TACAS-2012-FriedmannL #analysis #automaton- Ramsey-Based Analysis of Parity Automata (OF, ML), pp. 64–78.
- ICALP-v1-2012-LokshtanovR #constraints #multi
- Parameterized Tractability of Multiway Cut with Parity Constraints (DL, MSR), pp. 750–761.
- ICALP-v2-2012-AtseriasD #approximate #bound #quantifier
- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.
- ICALP-v2-2012-FearnleyS #bound #game studies
- Time and Parallelizability Results for Parity Games with Bounded Treewidth (JF, SS), pp. 189–200.
- GRAPHITE-2012-KantP #equation #game studies #performance
- Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games (GK, JvdP), pp. 50–65.
- DATE-2011-PalframanKL #detection #fault #low cost
- Time redundant parity for low-cost transient error detection (DJP, NSK, MHL), pp. 52–57.
- ICALP-v1-2011-GuoLV #complexity #problem #symmetry
- The Complexity of Symmetric Boolean Parity Holant Problems — (Extended Abstract) (HG, PL, LGV), pp. 712–723.
ICFP-2011-GillF #fault #implementation #performance- Deriving an efficient FPGA implementation of a low density parity check forward error corrector (AG, AF), pp. 209–220.
CSL-2011-CaiZ #bound- Tight Upper Bounds for Streett and Parity Complementation (YC, TZ), pp. 112–128.
- ICALP-v2-2010-ChatterjeeD #energy #game studies
- Energy Parity Games (KC, LD), pp. 599–610.
- DATE-2009-DemangelFDCW #architecture
- A generic architecture of CCSDS Low Density Parity Check decoder for near-earth applications (FD, NF, ND, FC, CW), pp. 1242–1245.
- TACAS-2009-BerwangerCWDH #game studies #named
- Alpaga: A Tool for Solving Parity Games with Imperfect Information (DB, KC, MDW, LD, TAH), pp. 58–61.
STOC-2009-KolaitisK #graph #quantifier #random- Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
- LICS-2009-Friedmann #algorithm #bound #exponential #game studies
- An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.
- STOC-2008-KalaiMV #learning #on the
- On agnostic boosting and parity learning (ATK, YM, EV), pp. 629–638.
- ICALP-B-2008-ColcombetL #automaton #nondeterminism
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.
FM-2008-GawlitzaS #analysis #game studies #precise- Precise Interval Analysis vs. Parity Games (TG, HS), pp. 342–357.
- CSL-2008-DawarG #complexity #game studies
- The Descriptive Complexity of Parity Games (AD, EG), pp. 354–368.
- CSL-2008-Schewe #algorithm #game studies
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (SS), pp. 369–384.
- DATE-2007-KhanA #architecture #configuration management #implementation #pipes and filters #programmable #realtime
- Pipelined implementation of a real time programmable encoder for low density parity check code on a reconfigurable instruction cell architecture (ZK, TA), pp. 349–354.
- FoSSaCS-2007-ChatterjeeHP #game studies
- Generalized Parity Games (KC, TAH, NP), pp. 153–167.
CAV-2007-AlfaroF #algorithm #game studies- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games (LdA, MF), pp. 108–120.
- CSL-2007-Obdrzalek #clique #game studies
- Clique-Width and Parity Games (JO), pp. 54–68.
- DAC-2006-VrankenGGSH #detection #fault
- Fault detection and diagnosis with parity trees for space compaction of test responses (HPEV, SKG, AG, JS, FH), pp. 1095–1098.
- FoSSaCS-2006-Serre #game studies #graph #process
- Parity Games Played on Transition Graphs of One-Counter Processes (OS), pp. 337–351.
DLT-2006-FritzW #automaton #game studies #simulation- Simulation Relations for Alternating Parity Automata and Parity Games (CF, TW), pp. 59–70.
- LICS-2006-Piterman #automaton #nondeterminism
- From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.
- LICS-2005-ChatterjeeHJ #game studies
- Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.
- DAC-2004-MohiyuddinPAW
- Synthesizing interconnect-efficient low density parity check codes (MM, AP, AA, WW), pp. 488–491.
- FoSSaCS-2004-Zielonka #game studies #probability
- Perfect-Information Stochastic Parity Games (WZ), pp. 499–513.
- CSL-2004-Gimbert #game studies #graph #infinity
- Parity and Exploration Games on Infinite Graphs (HG), pp. 56–70.
- DATE-2003-DrineasM #concurrent #detection #fault #monitoring
- Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees (PD, YM), pp. 11164–11167.
- ICALP-2003-Cachat #automaton #game studies #graph #higher-order
- Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.
- CSL-2003-Bradfield #independence
- Parity of Imperfection of Fixing Independence (JCB), pp. 72–85.
- CSL-2003-ChatterjeeJH #game studies #probability
- Simple Stochastic Parity Games (KC, MJ, TAH), pp. 100–113.
- FoSSaCS-2001-KingKV #automaton #complexity #on the #word
- On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
- 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.
- STOC-2000-BlumKW #learning #problem #query #statistics
- Noise-tolerant learning, the parity problem, and the statistical query model (AB, AK, HW), pp. 435–440.
CIAA-2000-SchmitzV #algorithm #finite #game studies #implementation- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games (DS, JV), pp. 263–271.
- CAV-2000-VogeJ #algorithm #game studies
- A Discrete Strategy Improvement Algorithm for Solving Parity Games (JV, MJ), pp. 202–215.
- DATE-1998-NicolaidisD #design #multi #predict
- Design of Fault-Secure Parity-Prediction Booth Multipliers (MN, RdOD), pp. 7–14.
- EDTC-1997-BolchiniSS #design #network #novel
- A novel methodology for designing TSC networks based on the parity bit code (CB, FS, DS), pp. 440–444.
SIGMOD-1996-MogiK #case study- Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 (KM, MK), pp. 183–194.
ASPLOS-1992-HollandG #array #clustering- Parity Declustering for Continuous Operation in Redundant Disk Arrays (MH, GAG), pp. 23–35.
HPDC-1992-NgM #array #maintenance #performance- Maintaining Good Performance In Disk Arrays During Failure via Uniform Parity Group Distribution (SWN, RLM), pp. 260–269.
- ASPLOS-1991-LeeK #array #performance
- Performance Consequences of Parity Placement in Disk Arrays (EKL, RHK), pp. 190–199.
VLDB-1990-GrayHW #array #low cost #reliability #throughput- Parity Striping of Disk Arrays: Low-Cost Reliable Storage with Acceptable Throughput (JG, BH, MW), pp. 148–161.
- ICALP-1985-GabowS #algorithm #performance
- Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) (HNG, MFMS), pp. 210–220.
