13 papers:
- ICALP-v1-2015-KomarathSS #bound #finite
- Comparator Circuits over Finite Bounded Posets (BK, JS, KSS), pp. 834–845.
- ICALP-v1-2013-Grier #finite #game studies
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (DG), pp. 497–503.
- ICALP-v1-2011-BermanBGRWY #transitive
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (PB, AB, EG, SR, DPW, GY), pp. 760–772.
- STOC-2010-FraigniaudK
- An optimal ancestry scheme and small universal posets (PF, AK), pp. 611–620.
- CIAA-2009-Zimmermann #game studies
- Time-Optimal Winning Strategies for Poset Games (MZ0), pp. 217–226.
- ESOP-2005-NiehrenPS #complexity #satisfiability #type system
- Complexity of Subtype Satisfiability over Posets (JN, TP, ZS), pp. 357–373.
- LICS-2004-DalmauKL #first-order #graph #problem #reflexive
- First-Order Definable Retraction Problems for Posets and Reflexive Graph (VD, AAK, BL), pp. 232–241.
- STOC-2002-FischerLNRRS #testing
- Monotonicity testing over general poset domains (EF, EL, IN, SR, RR, AS), pp. 474–483.
- ICALP-2000-Kuske #infinity #logic
- Infinite Series-Parallel Posets: Logic and Languages (DK), pp. 648–662.
- CAV-1998-BelluominiM #using #verification
- Verification of Timed Systems Using POSETs (WB, CJM), pp. 403–415.
- ICALP-1987-GambosiNT
- Posets, Boolean Representations and Quick Path Searching (GG, JN, MT), pp. 404–424.
- ICALP-1985-Gunter
- A Universal Domain Technique for Profinite Posets (CAG), pp. 232–243.
- STOC-1984-KahnS #comparison
- Every Poset Has a Good Comparison (JK, MES), pp. 299–301.