Остановите войну!
for scientists:
default search action
Search 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
Exact matches
- Martin Grohe
RWTH Aachen University, Germany
Likely matches
- Martin Groher
TU Munich, Computer Aided Medical Procedures, Germany
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 351 matches
- 2024
- Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke:
The Importance of Parameters in Database Queries. ICDT 2024: 14:1-14:17 - Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke:
The Importance of Parameters in Database Queries. CoRR abs/2401.04606 (2024) - Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld:
Selecting Walk Schemes for Database Embedding. CoRR abs/2401.11215 (2024) - Christopher Morris, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Fabrizio Frasca, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka:
Future Directions in Foundations of Graph Machine Learning. CoRR abs/2402.02287 (2024) - Martin Grohe, Eran Rosenbluth:
Are Targeted Messages More Effective? CoRR abs/2403.06817 (2024) - 2023
- Artur M. Schweidtmann, Jan G. Rittig, Jana M. Weber, Martin Grohe, Manuel Dahmen, Kai Leonhard, Alexander Mitsos:
Physical pooling functions in graph neural networks for molecular property prediction. Comput. Chem. Eng. 172: 108202 (2023) - Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52(6): S18-1 (2023) - Martin Grohe, Daniel Neuen, Daniel Wiebking:
Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. 52(1): 238-272 (2023) - Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24(1): 6:1-6:31 (2023) - Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld:
Selecting Walk Schemes for Database Embedding. CIKM 2023: 1677-1686 - Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS 2023: 798-809 - Jan Tönshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld:
Stable Tuple Embeddings for Dynamic Databases. ICDE 2023: 1286-1299 - Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. ICDT 2023: 20:1-20:19 - Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe:
WL meet VC. ICML 2023: 25275-25302 - Eran Rosenbluth, Jan Tönshoff, Martin Grohe:
Some Might Say All You Need Is Sum. IJCAI 2023: 4172-4179 - Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe:
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. IJCAI 2023: 4280-4288 - Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus:
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. LICS 2023: 1-13 - Martin Grohe:
The Descriptive Complexity of Graph Neural Networks. LICS 2023: 1-14 - Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. LICS 2023: 1-13 - Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe:
WL meet VC. CoRR abs/2301.11039 (2023) - Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR abs/2301.13317 (2023) - Eran Rosenbluth, Jan Tönshoff, Martin Grohe:
Some Might Say All You Need Is Sum. CoRR abs/2302.11603 (2023) - Martin Grohe:
The Descriptive Complexity of Graph Neural Networks. CoRR abs/2303.04613 (2023) - Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus:
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. CoRR abs/2304.12948 (2023) - Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR abs/2308.11970 (2023) - Hinrikus Wolf, Luca Oeljeklaus, Pascal Kühner, Martin Grohe:
Structural Node Embeddings with Homomorphism Counts. CoRR abs/2308.15283 (2023) - Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe:
Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. CoRR abs/2309.00367 (2023) - Steffen van Bergerem, Martin Grohe, Nina Runde:
On the Parameterized Complexity of Learning Monadic Second-Order Formulas. CoRR abs/2309.10489 (2023) - Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width. CoRR abs/2312.02048 (2023) - 2022
- Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. J. ACM 69(6): 46:1-46:52 (2022)
skipping 321 more matches
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-04-25 17:19 CEST 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