## Stem dag$ (all stems)

### 37 papers:

- DATE-2015-Baruah #graph #scheduling
- The federated scheduling of constrained-deadline sporadic DAG task systems (SB), pp. 1323–1328.
- PEPM-2015-BahrA #graph #traversal
- Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain (PB, EA), pp. 27–38.
- PLDI-2015-LalQ #graph #source code
- DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs (AL, SQ), pp. 280–290.
- SAC-2015-FonsecaNRP #execution #parallel #realtime
- A multi-DAG model for real-time parallel applications with conditional execution (JCF, VN, GR, LMP), pp. 1925–1932.
- SIGMOD-2012-HellingsFH #bisimulation #graph #performance
- Efficient external-memory bisimulation on DAGs (JH, GHLF, HJH), pp. 553–564.
- VLDB-2012-ZengH #algorithm #graph #pattern matching
- Comments on “Stack-based Algorithms for Pattern Matching on DAGs” (QZ, HZ), pp. 668–679.
- ICML-2012-Busa-FeketeBK #classification #graph #performance #using
- Fast classification using sparse decision DAGs (RBF, DB, BK), p. 99.
- SAC-2012-DragoB #analysis #architecture #design #graph #manycore #named
- DAG3: a tool for design and analysis of applications for multicore architectures (MLD, JB), pp. 1159–1164.
- ICML-2011-BiK #classification #multi
- MultiLabel Classification on Tree- and DAG-Structured Hierarchies (WB, JTK), pp. 17–24.
- DATE-2010-IqbalSH10a #estimation #execution #graph #monte carlo #named
- DAGS: Distribution agnostic sequential Monte Carlo scheme for task execution time estimation (NI, MAS, JH), pp. 1645–1648.
- SIGMOD-2010-MortonBG #graph #named #pipes and filters
- ParaTimer: a progress indicator for MapReduce DAGs (KM, MB, DG), pp. 507–518.
- SEKE-2010-KalayciDFES #adaptation #distributed #execution #workflow
- Distributed and Adaptive Execution of Condor DAGMan Workflows (SK, GD, LF, OE, SMS), pp. 587–590.
- CGO-2008-KoesG #graph
- Near-optimal instruction selection on dags (DRK, SCG), pp. 45–54.
- DLT-2007-Priese #automaton #finite #graph
- Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
- CAiSE-2007-EderW #comparison #detection #graph #ontology #using
- Change Detection in Ontologies Using DAG Comparison (JE, KW), pp. 21–35.
- LICS-2007-Nguyen #proving
- Separating DAG-Like and Tree-Like Proof Systems (PN), pp. 235–244.
- DAC-2006-MishchenkoCB #fresh look #logic #synthesis
- DAG-aware AIG rewriting a fresh look at combinational logic synthesis (AM, SC, RKB), pp. 532–535.
- DLT-2006-MenzelPS #graph
- Some Examples of Semi-rational DAG Languages (JRM, LP, MS), pp. 351–362.
- ICML-2006-LiM #correlation #modelling #topic
- Pachinko allocation: DAG-structured mixture models of topic correlations (WL, AM), pp. 577–584.
- KR-2006-WachterH #graph #representation
- Propositional DAGs: A New Graph-Based Language for Representing Boolean Functions (MW, RH), pp. 277–285.
- HPDC-2006-MalewiczFRW #evaluation
- A Tool for Prioritizing DAGMan Jobs and Its Evaluation (GM, ITF, ALR, MW), pp. 156–168.
- VLDB-2005-ChenGK #algorithm #graph #pattern matching
- Stack-based Algorithms for Pattern Matching on DAGs (LC, AG, MEK), pp. 493–504.
- ESOP-2005-ShiversW #bottom-up
- Bottom-Up β-Reduction: Uplinks and λ-DAGs (OS, MW), pp. 217–232.
- DLT-2005-Priese #graph #set
- Semi-rational Sets of DAGs (LP), pp. 385–396.
- PEPM-2002-SecherS #graph
- From checking to inference via driving and dag grammars (JPS, MHS), pp. 41–51.
- SAC-2000-LeeKHL #dependence #graph #scheduling #using
- Task Scheduling using a Block Dependency DAG for Block-Oriented Sparse Cholesky Factorization (HL, JK, SJH, SL), pp. 641–648.
- DATE-1999-AlippiFPS #approach #configuration management #design
- A DAG-Based Design Approach for Reconfigurable VLIW Processors (CA, WF, LP, MS), pp. 778–779.
- POPL-1999-Ertl #graph
- Optimal Code Selection in DAGs (MAE), pp. 242–249.
- DAC-1998-KukimotoBS #graph
- Delay-Optimal Technology Mapping by DAG Covering (YK, RKB, PS), pp. 348–351.
- ICML-1997-TingW #modelling
- Stacking Bagged and Dagged Models (KMT, IHW), pp. 367–375.
- PLILP-1996-Kessler #graph #scheduling
- Scheduling Expression DAGs for Minimal Register Need (CWK), pp. 228–242.
- POPL-1996-GhiyaH #analysis #c #graph #pointer
- Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C (RG, LJH), pp. 1–15.
- KDD-1994-Gaines #exception #graph
- Exception Dags as Knowledge Structures (BRG), pp. 13–24.
- PLDI-1989-CytronHH #automation #generative #graph #parallel
- Automatic Generation of DAG Parallelism (RC, MH, WCH), pp. 54–68.
- DAC-1987-Keutzer #graph #named #optimisation
- DAGON: Technology Binding and Local Optimization by DAG Matching (KK), pp. 341–347.
- POPL-1983-BackMR #algorithm #graph #performance
- Derivation of Efficient DAG Marking Algorithms (RJB, HM, KJR), pp. 20–27.
- ICALP-1979-KamimuraS #graph
- DAGs and Chomsky Hierarchy (Extended Abstract) (TK, GS), pp. 331–337.