30 papers:
CIAA-2015-Prusa #context-free grammar #decidability #multi #problem- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (DP), pp. 250–262.
ICALP-v2-2015-BenesBLS #automaton #parametricity- Language Emptiness of Continuous-Time Parametric Timed Automata (NB, PB, KGL, JS), pp. 69–81.
SIGMOD-2014-MottinMRDPV #interactive #named #problem #query- IQR: an interactive query relaxation system for the empty-answer problem (DM, AM, SBR, GD, TP, YV), pp. 1095–1098.
- ICALP-v2-2014-Wehar
- Hardness Results for Intersection Non-Emptiness (MW), pp. 354–362.
VLDB-2013-MottinMRDPV #framework #optimisation #probability #problem- A Probabilistic Optimization Framework for the Empty-Answer Problem (DM, AM, SBR, GD, TP, YV), pp. 1762–1773.
CAV-2013-LaarmanODLP #abstraction #automaton #manycore #using- Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction (AL, MCO, AED, KGL, JvdP), pp. 968–983.
KDD-2012-CorreaL #clustering #graph #using- Locally-scaled spectral clustering using empty region graphs (CDC, PL), pp. 1330–1338.
- ICALP-v2-2011-BertrandBBS #automaton #problem
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
CHI-2011-GettyCGNWH #facebook- I said your name in an empty room: grieving and continuing bonds on facebook (EG, JC, MG, CN, EW, JTH), pp. 997–1000.
KR-2010-BaaderBLW #logic #query- Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
- CAV-2010-HerbreteauSW #automaton #performance
- Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.
LICS-2010-BargunoCGJV #automaton #constraints #problem- The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
- CHI-2009-LottridgeMM #design
- Sharing empty moments: design for remote couples (DML, NM, WEM), pp. 2329–2338.
DLT-2008-AtigBH #automaton #multi- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.
- VLDB-2006-Luo #detection #performance #query
- Efficient Detection of Empty-Result Queries (GL), pp. 1015–1025.
ICPR-v1-2006-AnwarF #fault #robust #towards- Towards Robust Voxel-Coloring: Handling Camera Calibration Errors and Partial Emptiness of Surface Voxels (ZA, FPF), pp. 98–102.
DAC-2004-HandaV #algorithm #online #performance- An efficient algorithm for finding empty space for online FPGA placement (MH, RV), pp. 960–965.
DATE-v1-2004-HandaV #algorithm #performance- A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.
- DATE-2002-ZhuangKSJ
- An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees (CZ, YK, KS, LJ), pp. 61–68.
- LICS-2002-FioreCB #morphism #λ-calculus
- Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.
- ICPR-v2-2000-Duin #classification
- Classifiers in Almost Empty Spaces (RPWD), pp. 2001–2007.
POPL-2000-ChungMES- Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.
STOC-1998-KupfermanV #automaton- Weak Alternating Automata and Tree Automata Emptiness (OK, MYV), pp. 224–233.
- DLT-1995-Holzer #automaton #finite #on the
- On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.
- LICS-1994-Urzyczyn #problem
- The Emptiness Problem for Intersection Types (PU), pp. 300–309.
ILPS-1993-DevienneLR #decidability #horn clause #problem #recursion- The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable (PD, PL, JCR), pp. 250–265.
CADE-1992-Cohn #logic- A Many Sorted Logic with Possibly Empty Sorts (AGC), pp. 633–647.
CSL-1991-ThistleW #automaton #problem- Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.
- CSL-1988-Wagner #automaton #logic #on the #problem #source code
- On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
- POPL-1987-MeyerMMS #polymorphism #λ-calculus
- Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.
