default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 18 matches
- 2023
- Jade Master, Martha Lewis:
Proceedings Fifth International Conference on Applied Category Theory, ACT 2022, Glasgow, United Kingdom, 18-22 July 2022. EPTCS 380, 2023 [contents] - 2022
- David I. Spivak:
Polynomial functors and Shannon entropy. ACT 2022: 331-343 - Pietro Vertechi:
Dependent Optics. ACT 2022: 128-144 - Guillaume Boisseau, Chad Nester, Mario Román:
Cornering Optics. ACT 2022: 97-110 - Brandon Shapiro, David I. Spivak:
Dynamic categories, dynamic operads: From deep learning to prediction markets. ACT 2022: 183-202 - Steve Huntsman:
Magnitude and topological entropy of digraphs. ACT 2022: 254-267 - Mario Román:
Promonads and String Diagrams for Effectful Categories. ACT 2022: 344-361 - John Baez
, Xiaoyan Li, Sophie Libkind, Nathaniel Osgood, Evan Patterson:
Compositional Modeling with Stock and Flow Diagrams. ACT 2022: 77-96 - Elena Di Lavore, Pawel Sobocinski:
Monoidal Width: Capturing Rank Width. ACT 2022: 268-283 - James Hefford, Cole Comfort:
Coend Optics for Quantum Combs. ACT 2022: 63-76 - Toby St Clere Smithe:
Open dynamical systems as coalgebras for polynomial functors, with application to predictive processing. ACT 2022: 307-330 - Matteo Capucci:
Diegetic representation of feedback in open games. ACT 2022: 145-158 - Leo Lobski, Fabio Zanasi:
String Diagrams for Layered Explanations. ACT 2022: 362-382 - Andrea Censi, Emilio Frazzoli, Jonathan Lorand, Gioele Zardini:
Categorification of Negative Information using Enrichment. ACT 2022: 22-40 - Amar Hadzihasanovic, Diana Kessler:
Data structures for topologically sound higher-dimensional diagram rewriting. ACT 2022: 111-127 - Malin Altenmüller, Ross Duncan:
A Category of Surface-Embedded Graphs. ACT 2022: 41-62 - Ezra Schoen:
Lax Liftings and Lax Distributive Laws. ACT 2022: 237-253 - Flavien Breuvart, Dylan McDermott, Tarmo Uustalu:
Canonical Gradings of Monads. ACT 2022: 1-21
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-22 00:32 CET from data curated 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:
