Search results for "acyclic"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Shunsuke Inenaga, Masayuki Takeda	Sparse Directed Acyclic Word Graphs.	SPIRE	2006	DBLP DOI BibTeX RDF
26	Yong Chang Kim, Vishwani D. Agrawal, Kewal K. Saluja	Combinational automatic test pattern generation for acyclic sequential circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
26	Catherine S. Greenhill, Oleg Pikhurko	Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
26	José João Morais, Nelma Moreira, Rogério Reis	Acyclic Automata with Easy-to-Find Short Regular Expressions.	CIAA	2005	DBLP DOI BibTeX RDF
26	Torsten Tholey	Finding Disjoint Paths on Directed Acyclic Graphs.	WG	2005	DBLP DOI BibTeX RDF
26	Stavros D. Nikolopoulos, Leonidas Palios	Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation.	Algorithmica	2004	DBLP DOI BibTeX RDF	Comparability graph, P4-comparability graph, P4-component, P4-transitive orientation, Recognition, Perfectly orderable graph
26	Thomas Linke, Hans Tompits, Stefan Woltran	On Acyclic and Head-Cycle Free Nested Logic Programs.	ICLP	2004	DBLP DOI BibTeX RDF
26	Fei Liu 0007, Wenju Zhang, Shui Yu 0003, Fanyuan Ma, Minglu Li 0001	A Peer-to-Peer Hypertext Categorization Using Directed Acyclic Graph Support Vector Machines.	PDCAT	2004	DBLP DOI BibTeX RDF
26	Yong Ou, Joanne Bechta Dugan	Approximate sensitivity analysis for acyclic Markov reliability models.	IEEE Trans. Reliab.	2003	DBLP DOI BibTeX RDF
26	Aleksandrs Slivkins	Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs.	ESA	2003	DBLP DOI BibTeX RDF
26	Uriel Feige, Christian Scheideler	Improved Bounds for Acyclic Job Shop Scheduling.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68M20, 90B35, 68W25
26	Boonserm Kijsirikul, Nitiwut Ussivakul, Surapant Meknavin	Adaptive Directed Acyclic Graphs for Multiclass Classification.	PRICAI	2002	DBLP DOI BibTeX RDF
26	Patrick Healy, Nikola S. Nikolov	Facets of the Directed Acyclic Graph Layering Polytope.	WG	2002	DBLP DOI BibTeX RDF
26	Patrick Healy, Nikola S. Nikolov	How to Layer a Directed Acyclic Graph.	GD	2001	DBLP DOI BibTeX RDF
26	Tomoya Takasaki, Hideo Fujiwara, Tomoo Inoue	A High-Level Synthesis Approach to Partial Scan Design Based on Acyclic Structure.	Asian Test Symposium	1999	DBLP DOI BibTeX RDF
26	Bruce W. Watson	A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs.	Workshop on Implementing Automata	1998	DBLP DOI BibTeX RDF
26	Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes	Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF	communication in interconnection networks, routing, parallel algorithms, graph theory, computational and structural complexity
26	Giuseppe Di Battista, Roberto Tamassia	Upward Drawings of Acyclic Digraphs.	WG	1987	DBLP DOI BibTeX RDF
26	Klaus Simon	An Improved Algorithm for Transitive Closure on Acyclic Digraphs.	ICALP	1986	DBLP DOI BibTeX RDF
26	Z. Meral Özsoyoglu, Elarbi Choukhmane	On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries.	PODS	1984	DBLP DOI BibTeX RDF
26	David Maier 0001, Jeffrey D. Ullman	Connections in Acyclic Hypergraphs.	PODS	1982	DBLP DOI BibTeX RDF
26	Manfred Schnitzler	Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs.	WG	1980	DBLP DOI BibTeX RDF
25	Raphael Yuster	The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs.	Electron. J. Comb.	2022	DBLP DOI BibTeX RDF
25	Julien Herrmann, M. Yusuf Özkaya, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek	Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs.	SIAM J. Sci. Comput.	2019	DBLP DOI BibTeX RDF
25	Julien Herrmann, Jonathan Kho, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek	Acyclic Partitioning of Large Directed Acyclic Graphs.	CCGrid	2017	DBLP DOI BibTeX RDF
25	Ichiro Toyoshima, Shingo Yamaguchi, Yuki Murakami	Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2015	DBLP DOI BibTeX RDF
25	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of acyclic and almost acyclic CNF formulas.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
25	Yuki Murakami, Ichiro Toyoshima, Shingo Yamaguchi	Sufficient Condition on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets.	CANDAR	2013	DBLP DOI BibTeX RDF
25	Shingo Yamaguchi	Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets.	IEICE Trans. Inf. Syst.	2012	DBLP DOI BibTeX RDF
25	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)	CoRR	2011	DBLP BibTeX RDF
25	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
25	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and Almost Acyclic CNF Formulas.	FSTTCS	2010	DBLP DOI BibTeX RDF
25	Ron Aharoni, Eli Berger, Ori Kfir	Acyclic systems of representatives and acyclic colorings of digraphs.	J. Graph Theory	2008	DBLP DOI BibTeX RDF
25	Theologos Bountourelis	Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs.		2008	RDF
22	Ernie Chan, Robert A. van de Geijn, Andrew Chapman	Managing the complexity of lookahead for LU factorization with pivoting.	SPAA	2010	DBLP DOI BibTeX RDF	LU factorization with partial pivoting, algorithm-by-blocks, directed acyclic graph, lookahead
22	Tadao Takaoka	Partial Solution and Entropy.	MFCS	2009	DBLP DOI BibTeX RDF	adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees
22	David Corriveau, Madjid Allili	Computing Homology: A Global Reduction Approach.	DGCI	2009	DBLP DOI BibTeX RDF	Homology Computation, Generators, Reduction, Directed Acyclic Graphs
22	Kuan-Chou Lai, Chao-Tung Yang	A dominant predecessor duplication scheduling algorithm for heterogeneous systems.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Distributed computing, Heterogeneity, Task scheduling, Directed acyclic graph, Duplication
22	Kazutaka Shimada, Daigo Hashimoto, Tsutomu Endo	A Graph-Based Approach for Sentiment Sentence Extraction.	PAKDD Workshops	2008	DBLP DOI BibTeX RDF	Sentiment Sentence Extraction, Graph-based Approach, Hierarchical Directed Acyclic Graph, Similarity, Sentiment Analysis
22	Martin Graham 0001, Jessie B. Kennedy	Exploring Multiple Trees through DAG Representations.	IEEE Trans. Vis. Comput. Graph.	2007	DBLP DOI BibTeX RDF	Multiple trees, Directed Acyclic Graph
22	Lutz Priese	Finite Automata on Unranked and Unordered DAGs.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF	regular dag languages, directed acyclic graphs, finite state automata
22	Zhiyong Yu 0001, Zhiyi Yang, Fan Zhang, Zhiwen Yu 0001, Tuanqing Zhang	Replication-Based Partial Dynamic Scheduling on Heterogeneous Network Processors.	APPT	2007	DBLP DOI BibTeX RDF	partial dynamic scheduling, scheduling, directed acyclic graph, network processors, task replication
22	Brad Lushman, Gordon V. Cormack	A larger decidable semiunification problem.	PPDP	2007	DBLP DOI BibTeX RDF	acyclic semiunification, semiunification, decidability
22	Hui-yun Quan, Guangyi Yang	Gene Expression Programming with DAG Chromosome.	ISICA	2007	DBLP DOI BibTeX RDF	directed acyclic graph, symbolic regression, gene expression programming
22	Yangjun Chen, Donovan Cooke	On the transitive closure representation and adjustable compression.	SAC	2006	DBLP DOI BibTeX RDF	databases, directed acyclic graphs, transitive closures, graph decomposition, branchings, topological order
22	Yang Bo He, Zhi Geng, Xun Liang 0001	Learning Causal Structures Based on Markov Equivalence Class.	ALT	2005	DBLP DOI BibTeX RDF	Causal structure, Constrained essential graph, Randomization experiments, Bayesian networks, Directed acyclic graphs
22	Xiaohan Wang, Xiaolin Wu 0001	Optimal packetization of VLC and convolution coded Markov sequences.	ICME	2005	DBLP DOI BibTeX RDF	optimal packetization scheme, convolution coded Markov sequence, minimum expected distortion, weighted directed acyclic graph, dynamic programming, joint source-channel coding, variable length code, VLC, binary symmetric channel
22	Rashmi Bajaj, Dharma P. Agrawal	Improving Scheduling of Tasks in a Heterogeneous Environment.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	network of processors, directed acyclic graph, Communication cost, heterogeneous environment, optimal scheduling, computational cost, task duplication
22	Xiao-Dong Zhang 0001, Stanislaw Bylka	Disjoint Triangles of a Cubic Line Graph.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	The acyclic chromatic number, Triangle, Line graph, Cubic graph
22	Rameswar Debnath, N. Takahide, Haruhisa Takahashi	A decision based one-against-one method for multi-class support vector machine.	Pattern Anal. Appl.	2004	DBLP DOI BibTeX RDF	Direct acyclic graph support vector machine (DAGSVM), One-against-all, One-against-one, Support vector machine (SVM)
22	Ana Maria Madrigal, Jim Q. Smith	Causal Identification in Design Networks.	MICAI	2004	DBLP DOI BibTeX RDF	Design interventions and strategies, Identification of Policy Effects, Confounders, Directed Acyclic Graphs (DAGs), Influence diagrams, Causal inference, Bayesian decision theory
22	Azaria Paz	An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies.	Soft Comput.	2003	DBLP DOI BibTeX RDF	Annotated Graph, Collider, Discrete Probabilistic Distribution (PD), Independency Relation - Conditional, Undirected Graph (UG), Directed Acyclic Graph (DAG)
22	Siome Goldenstein, Christian Vogler, Dimitris N. Metaxas	Statistical Cue Integration in DAG Deformable Models.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	Statistical cue integration, deformable model tracking, deformable model representation, directed acyclic graphs, face tracking, affine arithmetic
22	Eugene Shragowitz, Habib Youssef, Bing Lu	Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	duration of activities, scheduling, approximation algorithms, directed acyclic graphs, NP-complete problems, critical path, timing bounds, PERT, slack
22	Jie Wu 0001, Fei Dai 0001	An Extended Link Reversal Protocol in Dynamic Networks.	IPDPS	2003	DBLP DOI BibTeX RDF	spanning shortest path trees (SPT), Temporally-Ordered Routing Algorithm (TORA), sensor networks, Directed acyclic graphs (DAGs), dynamic networks
22	Jörg Flum, Markus Frick, Martin Grohe	Query evaluation via tree-decompositions.	J. ACM	2002	DBLP DOI BibTeX RDF	Acyclic conjunctive queries, combined complexity, hypergraphs, monadic second-order logic, tree-width
22	Wai Yin Mok	A Comparative Study of Various Nested Normal Forms.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	nested relation schemes, nested database schemes, nested databases, nested normal forms, conflict-free sets of MVDs, acyclic database schemes, nested database design, design flexibility, algorithms, object-relational databases, nested relations, data redundancy, object-relational database management systems, SQL:1999
22	Guillaume Fertin, André Raspaud, Bruce A. Reed	On Star Coloring of Graphs.	WG	2001	DBLP DOI BibTeX RDF	proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring
22	Samantha Ranaweera, Dharma P. Agrawal	A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems.	IPDPS	2000	DBLP DOI BibTeX RDF	Task Scheduling, Directed Acyclic Graph, Network-Of-Workstations, Heterogeneous Systems, Task Duplication
22	Jin Hyun Son, Myoung-Ho Kim	Finding the critical path in a time-constrained workflow.	RTCSA	2000	DBLP DOI BibTeX RDF	time-constrained workflow, workflow control constructs, workflow control structures, workflow issues, workflow resource management, workflow time management, real-time systems, business processes, queueing theory, directed graphs, directed acyclic graphs, critical path, computer engineering, workflow management software
22	Andrea Corradini 0001, Fabio Gadducci	An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories.	Appl. Categorical Struct.	1999	DBLP DOI BibTeX RDF	term graphs, symmetric monoidal categories, gs-monoidal categories, directed acyclic graphs, algebraic theories
22	Zdenek Tronícek	Problems Related to Subsequences and Supersequences.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	supersequence, Directed Acyclic Supersequence Graph, seaching subsequences, subsequence
22	Sajal K. Das 0001, Ajoy Kumar Datta, Sébastien Tixeuil	Self-Stabilizing Algorithms in DAG Structured Networks.	ISPAN	1999	DBLP DOI BibTeX RDF	fault-tolerance, Distributed systems, self-stabilization, directed acyclic graphs
22	Moez Ayed, Jean-Luc Gaudiot	Analysis of a Heuristic for Code Partitioning.	J. Supercomput.	1998	DBLP DOI BibTeX RDF	Distributed memory multiprocessor (DMM), processing element (PE), task merging, partition, directed acyclic graph (DAG), task, task graph, critical path
22	Sekhar Darbha, Santosh Pande	A Robust Compile Time Method for Scheduling Task Parallelism on Distributed Memory Machines.	J. Supercomput.	1998	DBLP DOI BibTeX RDF	Cost Variations, Robustness, Scheduling Algorithms, Directed Acyclic Graph, Distributed Memory Machines, task Parallelism
22	Sekhar Darbha, Dharma P. Agrawal	Optimal Scheduling Algorithm for Distributed-Memory Machines.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	task scheduling, Directed acyclic graph, distributed-memory machines, task duplication, optimal scheduling algorithms
22	Yu-Kwong Kwok, Ishfaq Ahmad	A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling
22	Gyung-Leen Park, Behrooz A. Shirazi, Jeff Marquis	DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems.	IPPS	1997	DBLP DOI BibTeX RDF	DFRN, duplication based scheduling, distributed memory multiprocessor systems, parallel execution time minimization, DBS algorithms, task duplication method, worst case behavior, tree structured input directed acyclic graph, time complexity, distributed memory systems, performance improvement, optimal schedule, boundary condition, multiprocessor scheduling problems
22	Hugo Bravo-Azlán, Alfredo Candia-Véjar	A Metaheuristic Solution to a Constrained Steiner Tree Problem.	SCCC	1997	DBLP DOI BibTeX RDF	metaheuristic solution, constrained Steiner tree problem, arc resource requirements, trees (mathematics), directed acyclic graphs, budget, simulated annealing algorithm
22	Daniel Bleichenbacher, Ueli M. Maurer	On the Efficiency of One-Time Digital Signatures.	ASIACRYPT	1996	DBLP DOI BibTeX RDF	Cryptography, Digital signature, Directed acyclic graph, One-way function, Partially ordered set
22	Panos A. Patsouris	Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases.	ICPADS	1996	DBLP DOI BibTeX RDF	two-level-hierarchies of objects, unit of reference, distributed object-oriented databases, partial directed acyclic graphs, vertices objects, Uni-Design, distribution design strategy, distributed databases, aggregation, object-oriented databases, directed graphs, grouping, association, equivalence relation
22	Ishfaq Ahmad, Yu-Kwong Kwok, Min-You Wu	Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors.	ISPAN	1996	DBLP DOI BibTeX RDF	edge-weighted directed acyclic graph, bounded number of processors scheduling, arbitrary processor network, scheduling, scheduling, parallel programming, processor scheduling, data flow graphs, task graphs, parallel processors, dataflow graph
22	Moreno Coli, Paolo Palazzari	Global execution time minimization by allocating tasks in parallel systems.	PDP	1995	DBLP DOI BibTeX RDF	global execution time minimization, heuristic criterion, starting population, static allocation, genetic algorithms, genetic algorithm, computational complexity, resource allocation, parallel machines, parallel machine, directed graphs, directed acyclic graphs, DAGs, processor scheduling, parallel systems, task allocation, NP-complete problem, execution time, minimisation, cost function, critical path, precedence relations, critical path analysis
22	Harsha Sathyamurthy, Sachin S. Sapatnekar, John P. Fishburn	Speeding up pipelined circuits through a combination of gate sizing and clock skew optimization.	ICCAD	1995	DBLP DOI BibTeX RDF	acyclic pipelines, area-delay tradeoff, clock skew optimization, cycle-borrowing, logic design, combinational circuits, logic CAD, pipeline processing, circuit CAD, circuit optimisation, gate sizing, logic gates, pipelined circuits, timing specifications
22	Dimitrios Karayiannis, Spyros Tragoudas	Uniform area timing-driven circuit implementation.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	circuit module, cell library, input-output paths, overall area, timing-driven circuit implementation, computational complexity, heuristics, CAD, delays, timing, sequential circuits, sequential circuits, NP-hard, directed graphs, combinational circuits, combinational circuits, logic CAD, polynomial time algorithm, directed acyclic graphs, circuit CAD, cellular arrays, propagation delay
22	Xinli Gu	RT level testability-driven partitioning.	VTS	1995	DBLP DOI BibTeX RDF	testability-driven partitioning, RT level designs, hard-to-test points, testability analysis algorithm, normal mode, design function, test mode, acyclic partition, BIST technique, fault diagnosis, logic testing, built-in self test, integrated circuit testing, design for testability, ATPG, automatic testing, logic CAD, fault coverage, logic partitioning, test application time, data path, testability measurements, DFT techniques
22	Chris J. Scheiman, Peter R. Cappello	A Period-Processor-Time-Minimal Schedule for Cubical Mesh Algorithms.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	period-processor-time-minimal schedule, cubical mesh algorithms, precedence-constrained multiprocessor schedules, toroidally connected mesh, scheduling, parallel algorithms, computational complexity, multiprocessor interconnection networks, directed graphs, systolic arrays, systolic array, directed acyclic graph, matrix algebra, matrix product, computationalcomplexity
22	Kamal Kumar Jain, V. Rajaraman	Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation
22	Simon S. Lam, A. Udaya Shankar	A Theory of Interfaces and Modules I-Composition Theorem.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	interface theory, composition theorem, interface satisfaction, service consumer, module design, module verification, user interfaces, formal specification, specification, system design, systems analysis, directed graphs, directed acyclic graph, modules, system modelling, system model, nodes, service provider, arcs
22	Robert P. Goldman, Eugene Charniak	A Language for Construction of Belief Networks.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	belief network construction language, directed acyclic graph representations, FRAIL3, forward-chaining language, conditional probability matrices, directed graphs, deductive databases, inference mechanisms, probability distributions, probabilistic reasoning, probabilistic logic, logic programming languages
22	Devendra Kumar	Systems with Low Distributed Simulation Overhead.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	overhead messages, acyclic systems, open cyclic queuingnetworks, distributed simulation algorithms, performance evaluation, distributed processing, queueing theory, digital simulation, programming theory, closed queuing networks
22	Peter R. Cappello	A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	hexagon shaped, cylinder connected, processor-time-minimal systolic array, cubical meshalgorithms, time-minimal multiprocessor schedules, processor-time-minimal scheduling, triangular shaped 2-D directed mesh, 2-D directed mesh, directedgraphs, parallel algorithms, computational complexity, topology, systolic arrays, directed acyclic graph, processing elements, matrix product
22	Chris J. Scheiman, Peter R. Cappello	A Processor-Time-Minimal Systolic Array for Transitive Closure.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	processor-time-minimal multiprocessor schedules, 2-D mesh, parallel algorithms, systolic array, systolic arrays, directed acyclic graph, multiprocessor schedule, transitive closure
22	Nihal Yazici-Pekergin, Jean-Marc Vincent	Stochastic Bounds on Execution Times of Parallel Programs.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	stochastic bound methods, interdependent tasks, acyclic directed graph, NBUE, exponential random variables, performance evaluation, parallel programs, parallel programming, performance measure, directed graphs, stochastic processes, execution times, task graph, synchronization constraints
22	Victor Wing-Kit Mak, Stephen F. Lundstrom	Predicting Performance of Parallel Computations.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	series-parallel directed acyclic graph, service centers, commercial multiprocessor, simulation, performance evaluation, parallel processing, parallel computations, queueing theory, directed graphs, performance prediction, concurrent systems, queuing network model, task system
22	Laurie J. Hendren, Alexandru Nicolau	Parallelizing Programs with Recursive Data Structures.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	disambiguation techniques, interference analysis tools, parallelization techniques, dynamically updatable trees, regular-expression-like representation, accessible nodes, parallel programming, data structures, directed graphs, interference, program compilers, trees (mathematics), directed acyclic graphs, parallelizing compilers, automatic parallelization, dynamic data structures, parallel programming languages, recursive data structures, imperative programs, imperative language
22	Jay Banerjee, Won Kim 0001, Sung-Jo Kim, Jorge F. Garza	Clustering a DAG for CAD Databases.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	CAD databases, clustered sequences, clustering sequences, data structure, data structures, computer-aided design, CAD, database management systems, directed graphs, storage management, storage management, DAG, direct acyclic graph, design hierarchy
22	Margaret H. Eich	Graph Directed Locking.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	lock conversion, database flow graph locking, non-two-phase methods, distributed databases, distributed databases, directed graphs, database theory, directed acyclic graph, system recovery, deadlock-free, database concurrency control
22	Sakti Pramanik, David Vineyard	Optimizing Join Queries in Distributed Databases.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	reduced cover set, acyclic query graph, partial order graph, minimum response time, optimization, computational complexity, computational complexity, graph theory, distributed databases, distributed database, distributed databases, optimisation, database theory, concurrent processing, join queries
22	Mike Adler	An Algebra for Data Flow Diagram Process Decomposition.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	data flow diagram process decomposition, De Marco representation scheme, input/output connectivity matrix, software engineering, software engineering, program verification, directed graphs, directed acyclic graph, grammar, programming theory, top-down method
22	Nathan Goodman, Oded Shmueli	Tree Queries: A Simple Class of Relational Queries.	ACM Trans. Database Syst.	1982	DBLP DOI BibTeX RDF	acyclic schemes, cyclic schemas, tree schemas, join, semijoin
21	Mingwen Chen, Songlin Hu, Zhiyong Liu 0002	Covering-Based Routing Algorithms for Cyclic Content-Based P/S System.	FAW	2009	DBLP DOI BibTeX RDF	cyclic topology, covering-based routing, content-based routing, publish/subscribe system
21	Kai Lu, Qiang Liu	An Algorithm Combining Graph-Reduction and Graph-Search for Workflow Graphs Verification.	CSCWD	2007	DBLP DOI BibTeX RDF
21	Denis Caromel, Guillaume Chazarain, Ludovic Henrio	Garbage Collecting the Grid: A Complete DGC for Activities.	Middleware	2007	DBLP DOI BibTeX RDF	grid computing, cycle detection, distributed garbage collection
21	Tamás Horváth 0001, Susanne Hoche, Stefan Wrobel	Effective rule induction from labeled graphs.	SAC	2006	DBLP DOI BibTeX RDF	graph mining, computational chemistry
21	Feodor F. Dragan, Irina Lomonosov	On Compact and Efficient Routing in Certain Graph Classes.	ISAAC	2004	DBLP DOI BibTeX RDF
21	Peter Harvey, Aditya Ghose	Reducing Redundancy in the Hypertree Decomposition Scheme.	ICTAI	2003	DBLP DOI BibTeX RDF
21	Marluce Rodrigues Pereira, Patrícia Kayser Vargas, Felipe M. G. França, Maria Clicia Stelling de Castro, Inês de Castro Dutra	Applying Scheduling by Edge Reversal to Constraint Partitioning.	SBAC-PAD	2003	DBLP DOI BibTeX RDF
21	Marc D. Riedel, Jehoshua Bruck	The synthesis of cyclic combinational circuits.	DAC	2003	DBLP DOI BibTeX RDF	feedback, logic synthesis, cycles, combinational logic
21	Taweesup Apiwattanapong, Mary Jean Harrold	Selective path profiling.	PASTE	2002	DBLP DOI BibTeX RDF	static analysis, dynamic analysis, path profiling