default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Zinn
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Tom J. Ameloot, Bas Ketsman
, Frank Neven, Daniel Zinn:
Datalog Queries Distributing over Components. ACM Trans. Comput. Log. 18(1): 5:1-5:35 (2017)- 2016
- [j3]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture. ACM Trans. Database Syst. 40(4): 21:1-21:45 (2016) - [c22]Daniel Zinn, Haicheng Wu, Jin Wang, Molham Aref, Sudhakar Yalamanchili:
General-purpose join algorithms for large graph triangle listing on heterogeneous systems. GPGPU@PPoPP 2016: 12-21 - 2015
- [c21]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Datalog Queries Distributing over Components. ICDT 2015: 308-323 - [i4]Daniel Zinn:
General-Purpose Join Algorithms for Listing Triangles in Large Graphs. CoRR abs/1501.06689 (2015) - 2014
- [c20]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture. PODS 2014: 64-75 - [c19]Haicheng Wu, Daniel Zinn, Molham Aref, Sudhakar Yalamanchili:
Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs. ADMS@VLDB 2014: 1-12 - 2013
- [c18]Sven Köhler, Bertram Ludäscher, Daniel Zinn:
First-Order Provenance Games. In Search of Elegance in the Theory and Practice of Computation 2013: 382-399 - [i3]Sven Köhler, Bertram Ludäscher, Daniel Zinn:
First-Order Provenance Games. CoRR abs/1309.2655 (2013) - [i2]Daniel Zinn, Todd J. Green, Bertram Ludäscher:
Win-Move is Coordination-Free (Sometimes). CoRR abs/1312.2919 (2013) - 2012
- [c17]Daniel Zinn, Todd J. Green, Bertram Ludäscher:
Win-move is coordination-free (sometimes). ICDT 2012: 99-113 - [i1]Daniel Zinn:
Weak Forms of Monotonicity and Coordination-Freeness. CoRR abs/1202.0242 (2012) - 2011
- [c16]Daniel Zinn, Quinn J. Hart, Timothy M. McPhillips, Bertram Ludäscher, Yogesh Simmhan, Michail Giakkoupis, Viktor K. Prasanna:
Towards Reliable, Performant Workflows for Streaming-Applications on Cloud Platforms. CCGRID 2011: 235-244 - [c15]Saumen C. Dey, Daniel Zinn, Bertram Ludäscher:
Reconciling Provenance Policy Conflicts by Inventing Anonymous Nodes. ESWC Workshops 2011: 172-185 - [c14]Lei Dou, Daniel Zinn, Timothy M. McPhillips, Sven Köhler, Sean Riddle, Shawn Bowers, Bertram Ludäscher:
Scientific workflow design 2.0: Demonstrating streaming data collections in Kepler. ICDE 2011: 1296-1299 - [c13]Saumen C. Dey, Daniel Zinn, Bertram Ludäscher:
Repairing Provenance Policy Violations by Inventing Non-Functional Nodes. RED@ESWC 2011 - [c12]Sven Köhler, Sean Riddle, Daniel Zinn, Timothy M. McPhillips, Bertram Ludäscher:
Improving Workflow Fault Tolerance through Provenance-Based Recovery. SSDBM 2011: 207-224 - [c11]Saumen C. Dey, Daniel Zinn, Bertram Ludäscher:
ProPub: Towards a Declarative Approach for Publishing Customized, Policy-Aware Provenance. SSDBM 2011: 225-243 - 2010
- [j2]Daniel Zinn, Shawn Bowers, Sven Köhler, Bertram Ludäscher:
Parallelizing XML data-streaming workflows via MapReduce. J. Comput. Syst. Sci. 76(6): 447-463 (2010) - [c10]Daniel Zinn, Shawn Bowers, Bertram Ludäscher:
XML-based computation for scientific workflows. ICDE 2010: 812-815 - [c9]Daniel Zinn, Bertram Ludäscher:
Abstract Provenance Graphs: Anticipating and Exploiting Schema-Level Data Provenance. IPAW 2010: 206-215
2000 – 2009
- 2009
- [j1]Timothy M. McPhillips, Shawn Bowers, Daniel Zinn, Bertram Ludäscher:
Scientific workflow design for mere mortals. Future Gener. Comput. Syst. 25(5): 541-551 (2009) - [c8]Daniel Zinn, Shawn Bowers, Timothy M. McPhillips, Bertram Ludäscher:
X-CSR: Dataflow Optimization for Distributed XML Process Pipelines. ICDE 2009: 577-580 - [c7]Daniel Zinn, Shawn Bowers, Timothy M. McPhillips, Bertram Ludäscher:
Scientific workflow design with data assembly lines. SC-WORKS 2009 - 2007
- [c6]Jedidiah R. Crandall, Daniel Zinn, Michael Byrd, Earl T. Barr, Rich East:
ConceptDoppler: a weather tracker for internet censorship. CCS 2007: 352-365 - [c5]Katja Hose, Christian Lemke, Kai-Uwe Sattler, Daniel Zinn:
A Relaxed But Not Necessarily Constrained Way from the Top to the Sky. OTM Conferences (1) 2007: 399-407 - [c4]Daniel Zinn, Jim Bosch, Michael Gertz:
Modeling and Querying Vague Spatial Objects Using Shapelets. VLDB 2007: 567-578 - 2005
- [c3]Katja Hose, Marcel Karnstedt, Anke Koch, Kai-Uwe Sattler, Daniel Zinn:
Processing Rank-Aware Queries in P2P Systems. DBISP2P 2005: 171-178 - [c2]Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Daniel Zinn:
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees. WebDB 2005: 109-114 - 2003
- [c1]Gunar Schorcht, Ian A. Troxel, Keyvan Farhangian, Peter Unger, Daniel Zinn, Colin K. Mick, Alan D. George, Horst Salzwedel:
System-Level Simulation Modeling with MLDesigner. MASCOTS 2003: 207-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
