The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for DAGs with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1989 (16) 1990-1994 (23) 1995-1996 (28) 1997-1998 (26) 1999-2000 (18) 2001-2002 (22) 2003 (20) 2004 (28) 2005 (34) 2006 (35) 2007 (32) 2008 (29) 2009 (26) 2010 (20) 2011-2012 (24) 2013-2014 (17) 2015-2016 (20) 2017 (16) 2018 (30) 2019 (20) 2020 (40) 2021 (31) 2022 (28) 2023 (36) 2024 (6)
Publication types (Num. hits)
article(228) inproceedings(392) phdthesis(5)
Venues (Conferences, Journals, ...)
CoRR(101) IPDPS(18) NeurIPS(10) Euro-Par(9) IEEE Trans. Parallel Distribut...(9) ICML(8) SODA(8) AAAI(7) ESA(7) ICALP(7) ICPP(7) WG(7) Algorithmica(6) UAI(6) ACM Trans. Algorithms(5) IACR Cryptol. ePrint Arch.(5) More (+10 of total 308)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 340 occurrences of 220 keywords

Results
Found 625 publication records. Showing 625 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
127Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF IC-Scheduling theory, Scheduling dags, Grid computing, Theory, Global computing, Internet-based computing
97Grzegorz Malewicz, Arnold L. Rosenberg Batch-Scheduling Dags for Internet-Based Computing. Search on Bibsonomy Euro-Par The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
91Bertran Steinsky Efficient coding of labeled directed acyclic graphs. Search on Bibsonomy Soft Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Bayesian network, Rank, Generation, Directed acyclic graph (DAG), Enumeration
87Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych Toward a Theory for Scheduling Dags in Internet-Based Computing. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scheduling dags, dag decomposition, grid computing, theory, global computing, Internet-based computing, Web computing
86Christoph W. Keßler Scheduling Expression DAGs for Minimal Register Need. Search on Bibsonomy PLILP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
74Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg On Scheduling Expansive and Reductive Dags for Internet-Based Computing. Search on Bibsonomy ICDCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
74Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych On Scheduling Complex Dags for Internet-Based Computing. Search on Bibsonomy IPDPS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
64Konstantinos Kalpakis, Yaacov Yesha Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Tree dags, Mesh array, Scheduling, Parallel computation, Parallel architectures, Communication delay, Multiprocessing, Tree decomposition, Linear array
63Gennaro Cordasco, Arnold L. Rosenberg On scheduling dags to maximize area. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
63Hatem M. El-Boghdadi, Mohamed Bohalfaeh Code Generation: On the Scheduling of DAGs Using Worm-Partition. Search on Bibsonomy IPDPS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Radu Calinescu Bulk Synchronous Parallel Scheduling of Uniform Dags. Search on Bibsonomy Euro-Par, Vol. II The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
52Charanjit S. Jutla PRF Domain Extension Using DAGs. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Arnold L. Rosenberg, Matthew Yurkewych Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2005 DBLP  DOI  BibTeX  RDF reduction computations, convolutional computations, mesh-structured computations, tree-structured computations, scheduling, grid computing, global computing, Internet-based computing, Web computing
52Eyal Gordon, Adi Rosén Competitive weighted throughput analysis of greedy protocols on DAGs. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg Extending IC-Scheduling via the Sweep Algorithm. Search on Bibsonomy PDP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF IC-Scheduling Theory, gridcomputing, globalcomputing, schedulingDAGs, Internet-based computing
45Jean-Claude Bermond, Michel Cosnard Minimum number of wavelengths equals load in a DAG without internal cycle. Search on Bibsonomy IPDPS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz 0001, April Kwong, Stuart G. Stubblebine A General Model for Authenticated Data Structures. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Authentic publication, Security, Data structures, Database integrity
41Grzegorz Malewicz Parallel scheduling of complex dags under uncertainty. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF algorithms and theory, probabilistic failures, scheduling of dags, grid computing, combinatorial optimization, project management, resource constraints
40Matthias Baumgart 0001, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak All-Pairs Ancestor Problems in Weighted Dags. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Royi Ronen, Oded Shmueli Conjunctive Queries over DAGs. Search on Bibsonomy NGITS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Henan Zhao, Rizos Sakellariou Scheduling multiple DAGs onto heterogeneous systems. Search on Bibsonomy IPDPS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Lutz Priese Semi-rational Sets of DAGs. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Ankur Kamthe, Soo-Young Lee A Stochastic Approach to Estimating Earliest Start Times of Nodes for Scheduling DAGs on Heterogeneous Distributed Computing Systems. Search on Bibsonomy IPDPS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Arnold L. Rosenberg On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
40Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frédéric Vivien Retiming DAGs [direct acyclic graph]. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
35Antoine Genitrini, Martin Pépin, Alfredo Viola Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. Search on Bibsonomy LAGOS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
35Kamil Khadiev, Liliya Safina Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs. Search on Bibsonomy UCNC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
35Barbara Fila, Siva Anantharaman Automata for Positive Core XPath Queries on Compressed Documents. Search on Bibsonomy LPAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Tree grammars, Dags, Core XPath, XML, Automata
35Ana Maria Madrigal, Jim Q. Smith Causal Identification in Design Networks. Search on Bibsonomy MICAI The full citation details ... 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
35Yves Caniou, Emmanuel Jeannot Experimental Study of Multi-criteria Scheduling Heuristics for GridRPC Systems. Search on Bibsonomy Euro-Par The full citation details ... 2004 DBLP  DOI  BibTeX  RDF time-shared and heterogeneous resources, dynamic scheduling heuristics, historical trace manager, completion dates estimations, DAGs
35Moreno Coli, Paolo Palazzari Global execution time minimization by allocating tasks in parallel systems. Search on Bibsonomy PDP The full citation details ... 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
34Sinisa Todorovic, Narendra Ahuja Region-Based Hierarchical Image Matching. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Edit-distance graph matching, Many-to-many matching, Maximum subtree isomorphism, Image matching, Transitive closures, Segmentation trees, Maximum weight cliques, Association graphs
34Yoginder S. Dandass, Amit C. Bugde Comparison of genetic representation schemes for scheduling soft real-time parallel applications. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF genetic list scheduling, soft real-time scheduling, genetic algorithms
34Zvi Lotker, Boaz Patt-Shamir Average-Case Analysis of Greedy Packet Scheduling. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34S. K. Michael Wong, Dan Wu 0006, Tao Lin 0012 A Structural Characterization of DAG-Isomorphic Dependency Models. Search on Bibsonomy AI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Zvi Lotker, Boaz Patt-Shamir Average-case analysis of greedy packet scheduling (extended astract). Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie Competitive Implementation of Parallel Programs. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Scheduling, Parallel computation, Compiler, Competitive analysis, Communication delay
34Sekhar Darbha, Dharma P. Agrawal Optimal Scheduling Algorithm for Distributed-Memory Machines. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF task scheduling, Directed acyclic graph, distributed-memory machines, task duplication, optimal scheduling algorithms
34David A. Berson, Rajiv Gupta 0001, Mary Lou Soffa Integrated Instruction Scheduling and Register Allocation Techniques. Search on Bibsonomy LCPC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Gyung-Leen Park, Behrooz A. Shirazi, Jeff Marquis, Hyunseung Choo Decisive Path Scheduling: A New List Scheduling Method. Search on Bibsonomy ICPP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
34Flemming Andersen, Kim Dam Petersen, Jimmi S. Pettersson A Graphical Tool for Proving Unity Progress. Search on Bibsonomy TPHOLs The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
34Apostolos Gerasoulis, Sesh Venugopal, Tao Yang 0009 Clustering task graphs for message passing architectures. Search on Bibsonomy ICS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
29Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak A Path Cover Technique for LCAs in Dags. Search on Bibsonomy SWAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg On Clustering Tasks in IC-Optimal Dags. Search on Bibsonomy ICPP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Stefan Eckhardt, Andreas Michael Mühling, Johannes Nowak Fast Lowest Common Ancestor Computations in Dags. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Lutz Priese Finite Automata on Unranked and Unordered DAGs. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF regular dag languages, directed acyclic graphs, finite state automata
29Michael A. Bender, Cynthia A. Phillips Scheduling DAGs on asynchronous processors. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF asynchronous parallel computing, firing-squad scheduling, precedence-constrained scheduling, online scheduling
29Olin Shivers, Mitchell Wand Bottom-Up beta-Reduction: Uplinks and lambda-DAGs. Search on Bibsonomy ESOP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Irit Katriel Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. Search on Bibsonomy CPAIOR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Lascelles Adams, James F. Courtney Achieving Relevance in IS Research via the DAGS Framework. Search on Bibsonomy HICSS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Micah Adler, Adi Rosén Tight Bounds for the Performance of Longest-in-System on DAGs. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Luis M. de Campos, Juan M. Fernández-Luna, José Miguel Puerta Local Search Methods for Learning Bayesian Networks Using a Modified Neighborhood in the Space of DAGs. Search on Bibsonomy IBERAMIA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Min-You Wu, Wei Shu, Yong Chen Runtime Parallel Incremental Scheduling of DAGs. Search on Bibsonomy ICPP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
29Peter Becker 0001 A Temporal Logic Based Approach for Querying Lists, Trees, and DAGs in Databases Search on Bibsonomy DEXA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
24Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde A Tool for Prioritizing DAGMan Jobs and its Evaluation. Search on Bibsonomy J. Grid Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF dags, applications of theory, scheduling, Grid, systems, Condor, unpredictability
24Mourad Hakem, Franck Butelle Reliability and Scheduling on Systems Subject to Failures. Search on Bibsonomy ICPP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF precedence task graphs, directed acyclic graphs DAGs, clustering, scheduling, reliability, distributed computing, heterogeneous systems, multicriteria scheduling
24Yangjun Chen A new algorithm for computing transitive closures. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF DAGs, transitive closure, branching, topological order
24Jie Wu 0001, Fei Dai 0001 An Extended Link Reversal Protocol in Dynamic Networks. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF spanning shortest path trees (SPT), Temporally-Ordered Routing Algorithm (TORA), sensor networks, Directed acyclic graphs (DAGs), dynamic networks
24Evripidis Bampis, Charles Delorme, Jean-Claude König Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF scheduling, communication, grids, DAGs
24Tao Yang 0009, Apostolos Gerasoulis DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
23Yinglong Xia, Viktor K. Prasanna Collaborative scheduling of DAG structured computations on multicore processors. Search on Bibsonomy Conf. Computing Frontiers The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dag structured computations, lock free structures, task sharing, collaborative scheduling
23Ashish Kundu, Elisa Bertino How to authenticate graphs without leaking. Search on Bibsonomy EDBT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy Planar and Grid Graph Reachability Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
23Pushpa Kumar, Kang Zhang 0001 Visualization of clustered directed acyclic graphs with node interleaving. Search on Bibsonomy SAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF node interleaving, overlapping nodes, visualization, graph drawing, directed acyclic graphs
23Stefan Schirra Much Ado about Zero. Search on Bibsonomy Efficient Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF zero separation bound, exact geometric computation paradigm, real algebraic number computation
23Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry 3-HOP: a high-compression indexing scheme for reachability query. Search on Bibsonomy SIGMOD Conference The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 2-hop, 3-hop, path-tree, transitive closure, graph indexing, reachability queries
23Akio Fujiyoshi Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sarangi Theoretical Framework for Eliminating Redundancy in Workflows. Search on Bibsonomy IEEE SCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Julien Robert, Nicolas Schabanel Non-clairvoyant scheduling with precedence constraints. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF equi-partition, non-clairvoyant algorithm, fairness, online scheduling, precedences
23Sascha Hunold, Thomas Rauber, Frédéric Suter Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing. Search on Bibsonomy CCGRID The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dag scheduling, mixed-parallelism, clusters of clusters, workflow scheduling
23Mauricio Solar A Scheduling Algorithm to Optimize Parallel Processes. Search on Bibsonomy SCCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Pierre-Yves Koenig, Guy Melançon, Charles Bohan, Berengere Gautier Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data. Search on Bibsonomy IV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Fabrizio Frati On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding Cost-Based Query Optimization for Multi Reachability Joins. Search on Bibsonomy DASFAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Massimiliano Mascherini, Federico M. Stefanini Using Weak Prior Information on Structures to Learn Bayesian Networks. Search on Bibsonomy KES (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Prior information, Bayesian Networks, structural learning
23Didier Rémy, Boris Yakobowski A graphical presentation of MLF types with a linear-time unification algorithm. Search on Bibsonomy TLDI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF system SF, graphs, types, unification, binders, MLF
23Vida Dujmovic, David R. Wood Upward Three-Dimensional Grid Drawings of Graphs. Search on Bibsonomy Order The full citation details ... 2006 DBLP  DOI  BibTeX  RDF grid drawing, three dimensional graph drawing, upward drawing, track layout, upward track layout, upward queue layout, strong star colouring, harmonious colouring, graph drawing
23Fabio Aiolli, Giovanni Da San Martino, Alessandro Sperduti, Alessandro Moschitti Fast On-line Kernel Learning for Trees. Search on Bibsonomy ICDM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Kun-Feng Lin, Chuan-Ming Liu Broadcasting dependent data with minimized access latency in a multi-channel environment. Search on Bibsonomy IWCMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF broadcasting, latency, NP-hard, DAG, multiple channels
23Kun-Feng Lin, Chuan-Ming Liu Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels. Search on Bibsonomy SUTC (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Johann Eder, Karl Wiggisser A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing. Search on Bibsonomy ER (Workshops) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Doruk Bozdag, Ümit V. Çatalyürek, Füsun Özgüner A task duplication based bottom-up scheduling algorithm for heterogeneous environments. Search on Bibsonomy IPDPS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23E. Ilavarasan, P. Thambidurai Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System. Search on Bibsonomy DFMA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23José A. Gámez 0001, José Miguel Puerta Constrained Score+(Local)Search Methods for Learning Bayesian Networks. Search on Bibsonomy ECSQARU The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Silke Trißl, Ulf Leser Querying Ontologies in Relational Database Systems. Search on Bibsonomy DILS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Benedikt Bollig On the Expressiveness of Asynchronous Cellular Automata. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Chad E. Brown Reasoning in Extensional Type Theory with Equality. Search on Bibsonomy CADE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Nik Swoboda, Gerard Allwein Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference. Search on Bibsonomy Softw. Syst. Model. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Euler and Venn diagrams, Graph transformation, Diagrammatic reasoning, Proof verification
23Bertran Steinsky Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Labelled essential directed acyclic graph, Chain graph, Asymptotic enumeration, Bayesian network
23Brent Heeringa, Micah Adler Optimal Website Design with the Constrained Subtree Selection Problem. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Till Tantau A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Xuan-Ha Vu, Hermann Schichl, Djamila Sam-Haroud Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems. Search on Bibsonomy ICTAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Guodong Li, Daoxu Chen, Daming Wang, Defu Zhang Task Clustering and Scheduling to Multiprocessors with Duplication. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23Peter R. Cappello, Ömer Egecioglu Automatic Processor Lower Bound Formulas for Array Computations. Search on Bibsonomy ISPAN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Array computation, Diophantine system, lower bound
23Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl Parallel processor scheduling with delay constraints. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
23Sekhar Darbha, Dharma P. Agrawal A Duplication Based Compile Time Scheduling Method for Task Parallelism. Search on Bibsonomy Compiler Optimizations for Scalable Parallel Systems Languages The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Ali Shokoufandeh, Sven J. Dickinson Graph-Theoretical Methods in Computer Vision. Search on Bibsonomy Theoretical Aspects of Computer Science The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
23Eleftherios D. Polychronopoulos, Theodore S. Papatheodorou Scheduling User-Level Threads on Distributed Shared-Memory Multiprocessors. Search on Bibsonomy Euro-Par The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Yossi Matias, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp, Jacob Ziv Augmenting Suffix Trees, with Applications. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Yu-Kwong Kwok, Ishfaq Ahmad A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors. Search on Bibsonomy IEEE PACT The full citation details ... 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
Displaying result #1 - #100 of 625 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license