Stem acycl$ (all stems)

74 papers:

DATE-2014-FrijnsASVGSC #analysis #graph

Timing analysis of First-Come First-Served scheduled interval-timed Directed Acyclic Graphs (RF, SA, SS, JV, MCWG, RRHS, HC), pp. 1–6.

LATA-2014-BeerenwinkelBBDP #graph

Covering Pairs in Directed Acyclic Graphs (NB, SB, PB, RD, YP), pp. 126–137.

AdaEurope-2014-QamhiehM #analysis #graph #multi #scheduling

Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level (MQ, SM), pp. 119–133.

KR-2014-GebserJR #encoding

ASP Encodings of Acyclicity Properties (MG, TJ, JR).

SAT-2014-CapelliDM

Hypergraph Acyclicity and Propositional Model Counting (FC, AD, SM), pp. 399–414.

PODS-2013-BaezaRV #database #graph #semantics

Semantic acyclicity on graph databases (PBB, MR, MYV), pp. 237–248.

SAC-2013-KumarR #algorithm #data type #identification #online

Online identification of frequently executed acyclic paths by leveraging data stream algorithms (GK, SR), pp. 1694–1695.

CIAA-2012-JiraskovaM #complexity #on the

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.

ICALP-v1-2012-GaspersS #satisfiability

Backdoors to Acyclic SAT (SG, SS), pp. 363–374.

ICALP-v1-2012-KratschPPW #graph #multi #parametricity

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs (SK, MP, MP, MW), pp. 581–593.

KR-2012-GrauHKKMMW #logic #query

Acyclicity Conditions and their Application to Query Answering in Description Logics (BCG, IH, MK, CK, DM, BM, ZW).

CSL-2012-Brault-Baron #query

A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.

CIAA-2011-CarninoF #automaton #generative #markov #random #using

Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.

SAT-2011-OrdyniakPS #satisfiability

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.

LICS-2010-Otto

Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (MO), pp. 11–20.

CASE-2009-BountourelisR #algorithm #learning

Customized learning algorithms for episodic tasks with acyclic state spaces (TB, SR), pp. 627–634.

CIAA-2009-CaronCM #automaton

Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.

CIAA-2009-Fujiyoshi #automaton #graph #recognition

Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.

ICEIS-DISI-2009-Chen #graph

Directed Acyclic Graphs and Disjoint Chains (YC), pp. 17–24.

ICML-2009-KuzelkaZ #relational

Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties (OK, FZ), pp. 569–576.

SAC-2009-KumarZ #clustering #graph #visualisation

Visualization of clustered directed acyclic graphs with node interleaving (PK, KZ), pp. 1800–1805.

LICS-2008-Duris #theorem

Hypergraph Acyclicity and Extension Preservation Theorems (DD), pp. 418–427.

CIAA-J-2006-GiraudVL07 #automaton

Path-Equivalent Developments in Acyclic Weighted Automata (MG, PV, DL), pp. 799–811.

CIAA-2007-ChamparnaudGF #transducer

Reducing Acyclic Cover Transducers (JMC, FG, JF), pp. 38–50.

ICALP-2007-KreutzerOS #bound #monad

Boundedness of Monadic FO over Acyclic Structures (SK, MO, NS), pp. 571–582.

MLDM-2007-WuW #graph #kernel #parametricity

Choosing the Kernel Parameters for the Directed Acyclic Graph Support Vector Machines (KPW, SDW), pp. 276–285.

CSL-2007-BaganDG #constant #on the #query

On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.

CASE-2006-ReveliotisB #algorithm #learning #performance

Efficient learning algorithms for episodic tasks with acyclic state spaces (SR, TB), pp. 411–418.

PODS-2006-PaghP #scalability

Scalable computation of acyclic joins (AP, RP), pp. 225–232.

ICALP-v1-2006-DyerGP #graph #morphism #on the

On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.

CSL-2006-Pagani #exponential #linear #logic #multi

Acyclicity and Coherence in Multiplicative Exponential Linear Logic (MP), pp. 531–545.

CIAA-2005-MoraisMR #automaton #regular expression

Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.

ICALP-2005-KowalukL #graph #query

LCA Queries in Directed Acyclic Graphs (MK, AL), pp. 241–248.

ECOOP-2005-LuP #reachability #type system

A Type System for Reachability and Acyclicity (YL, JP), pp. 479–503.

DATE-v1-2004-PerezMT #scheduling #using

A New Optimized Implemention of the SystemC Engine Using Acyclic Scheduling (DGP, GM, OT), pp. 552–557.

ICLP-2004-LinkeTW #logic programming #on the #source code

On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.

DAC-2003-BozorgzadehGTS #graph #integer

Optimal integer delay budgeting on directed acyclic graphs (EB, SG, AT, MS), pp. 920–925.

DAC-2003-Edwards

Making cyclic circuits acyclic (SAE), pp. 159–162.

DATE-2003-IchiharaI #fault #generative #testing

Test Generation for Acyclic Sequential Circuits with Single Stuck-at Fault Combinational ATPG (HI, TI), pp. 11180–11181.

CIAA-2003-GuingneKN #automaton #complexity

Running Time Complexity of Printing an Acyclic Automaton (FG, AK, FN), pp. 131–140.

CIAA-2003-MiyamotoITS #graph #word

Ternary Directed Acyclic Word Graphs (SM, SI, MT, AS), pp. 120–130.

AGTIVE-2003-AgnarssonEH #graph

Proper Down-Coloring Simple Acyclic Digraphs (GA, ÁSE, MMH), pp. 299–312.

TACAS-2002-Mateescu #calculus #lts #model checking #μ-calculus

Local Model-Checking of Modal μ-Calculus on Acyclic Labeled Transition Systems (RM), pp. 281–295.

CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.

CIAA-2001-GranaBA #automaton #compilation #finite #scalability

Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.

DLT-2001-NiemannW #context-sensitive grammar

The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages (GN, JRW), pp. 197–205.

ICALP-2001-GottlobP #clique #model checking

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width (GG, RP), pp. 708–719.

CIAA-2000-MihovM #transducer

Direct Construction of Minimal Acyclic Subsequential Transducers (SM, DM), pp. 217–229.

ICALP-2000-BenderR #graph #sublinear #testing

Testing Acyclicity of Directed Graphs in Sublinear Time (MAB, DR), pp. 809–820.

WIA-1999-Watson #algorithm #automaton #finite #taxonomy

A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.

CIKM-1999-TanzerS

Queryable Acyclic Production Systems (DT, DS), pp. 284–291.

STOC-1998-FeigeS #bound #scheduling

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract) (UF, CS), pp. 624–633.

WIA-1998-Watson #algorithm #performance

A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.

ICML-1998-ReddyT #first-order #learning #source code

Learning First-Order Acyclic Horn Programs from Entailment (CR, PT), pp. 472–480.

SAC-1998-AhmedDR #fuzzy #graph #memory management #performance #reuse #using

Fast recall of reusable fuzzy plans using acyclic directed graph memory (MA, ED, DCR), pp. 272–276.

ICML-1996-BoyanM #evaluation #learning #scalability

Learning Evaluation Functions for Large Acyclic Domains (JAB, AWM), pp. 63–70.

DAC-1994-CongLB #clustering #multi #network

Acyclic Multi-Way Partitioning of Boolean Networks (JC, ZL, RB), pp. 670–675.

CC-1994-FauthHKM #graph

Global Code Selection of Directed Acyclic Graphs (AF, GH, AK, CM), pp. 128–142.

PODS-1991-Ross #composition #logic programming #recursion #source code

Modular Acyclicity and Tail Recursion in Logic Programs (KAR), pp. 92–101.

CLP-1990-AptB90 #source code

Acyclic Programs (KRA, MB), pp. 617–633.

ICALP-1987-Metivier #algorithm #automaton #graph

An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.

PODS-1986-BiskupBSK

One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views (JB, HHB, LS, MK), pp. 148–159.

PODS-1986-RulandS #database #relational

Alpha-Acyclic Decompositions of Relational Database Schemes (DR, DS), pp. 191–201.

PODS-1986-SagivS86a #finite #on the

On Finite FD-Acyclicity (YS, OS), pp. 173–182.

ICALP-1986-Simon #algorithm #graph #transitive

An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.

PODS-1984-DAtriM #database #design #on the #recognition

On the Recognition and Design of Acyclic Databases (AD, MM), pp. 1–8.

PODS-1984-GrahneR #database #dependence

Dependency Characterizations for Acyclic Database Schemes (GG, KJR), pp. 9–18.

PODS-1984-OzsoyogluC #on the #query

On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (ZMÖ, EC), pp. 133–142.

VLDB-1984-Zhu #algorithm #database #graph #recognition

Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm (YzZ), pp. 218–221.

PODS-1983-Sacca #database #on the #recognition

On the Recognition of Coverings of Acyclic Database Hypergraphs (DS), pp. 297–304.

PODS-1982-MaierU

Connections in Acyclic Hypergraphs (DM, JDU), pp. 34–39.

VLDB-1981-Chase #database #graph

Join Graphs and Acyclic Database Schemes (KC), pp. 95–100.

VLDB-1981-Yannakakis #algorithm #database

Algorithms for Acyclic Database Schemes (MY), pp. 82–94.

STOC-1981-BeeriFMMUY #database

Properties of Acyclic Database Schemes (CB, RF, DM, AOM, JDU, MY), pp. 355–362.