default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWied Pakusa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c11]Manuel Bodirsky
, Wied Pakusa, Jakub Rydval:
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. LICS 2020: 237-251- [i4]Manuel Bodirsky, Wied Pakusa, Jakub Rydval:
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. CoRR abs/2002.09451 (2020)
2010 – 2019
- 2019
- [j5]Erich Grädel, Wied Pakusa:
Rank Logic is dead, Long Live Rank Logic! J. Symb. Log. 84(1): 54-87 (2019) - [j4]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15(1) (2019) - [c10]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. ICALP 2019: 112:1-112:14 - [i3]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. CoRR abs/1902.06648 (2019) - 2018
- [j3]Wied Pakusa, Svenja Schalthöfer, Erkal Selman:
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. ACM Trans. Comput. Log. 19(2): 7:1-7:27 (2018) - [i2]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR abs/1802.09377 (2018) - 2017
- [c9]Erich Grädel, Benedikt Pago, Wied Pakusa:
The Model-Theoretic Expressiveness of Propositional Proof Systems. CSL 2017: 27:1-27:18 - [c8]Martin Grohe, Wied Pakusa:
Descriptive complexity of linear equation systems and applications to propositional proof complexity. LICS 2017: 1-12 - [c7]Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa:
Definability of summation problems for Abelian groups and semigroups. LICS 2017: 1-11 - 2016
- [c6]Wied Pakusa, Svenja Schalthöfer, Erkal Selman:
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. CSL 2016: 19:1-19:17 - 2015
- [c5]Erich Grädel, Wied Pakusa:
Rank Logic is Dead, Long Live Rank Logic!. CSL 2015: 390-404 - [c4]Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa:
Defining Winning Strategies in Fixed-Point Logic. LICS 2015: 366-377 - [c3]Erich Grädel, Wied Pakusa, Svenja Schalthöfer, Lukasz Kaiser:
Characterising Choiceless Polynomial Time with First-Order Interpretations. LICS 2015: 677-688 - [i1]Erich Grädel, Wied Pakusa:
Rank logic is dead, long live rank logic! CoRR abs/1503.05423 (2015) - 2014
- [j2]Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa:
Model-Theoretic Properties of ω-Automatic Structures. Theory Comput. Syst. 55(4): 856-880 (2014) - [c2]Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa:
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. MFCS (1) 2014: 50-62 - 2013
- [j1]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. Log. Methods Comput. Sci. 9(4) (2013) - 2012
- [c1]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. CSL 2012: 213-227
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-10-07 22:10 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:
