default search action
Michael Frank 0002
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
Other persons with the same name
- Michael Frank
- Michael Frank 0001 — Bankmark, Passau, Germany (and 1 more)
- Michael Frank 0003
— University of Applied Sciences (HTWK) Leipzig, Faculty of Computer Science, Mathematics and Natural Sciences, Germany
- Michael Frank 0004 — SRI International, Menlo Park, CA, USA
- Michael Frank 0005 — Stanford University, Computer Science Department, CA, USA
- Michael Frank 0006 — TU Clausthal, Germany
- Michael Frank 0007 — Galileo Group, Inc., Melbourne, FL, USA
- Michael Frank 0008
- Michael Frank 0009
- Michael Frank 0010 — Technical University of Darmstadt, Institute for Production Management, Technology and Machine Tools, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c4]Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany:
Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). ICLP (Technical Communications) 2017: 5:1-5:18 - [c3]Michael Codish
The DNA Word Design Problem: A New Constraint Model and New Results. IJCAI 2017: 585-591 - 2016
- [j3]Michael Codish
Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. Constraints An Int. J. 21(3): 375-393 (2016) - [j2]Michael Codish
Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. 82(3): 551-563 (2016) - [j1]Michael Frank, Michael Codish
Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). Theory Pract. Log. Program. 16(5-6): 688-702 (2016) - [c2]Michael Frank:
Methods for Solving Extremal Problems in Practice. ICLP (Technical Communications) 2016: 21:1-21:6 - [i5]Michael Frank, Michael Codish:
Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). CoRR abs/1607.04829 (2016) - 2015
- [i4]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
When Six Gates are Not Enough. CoRR abs/1508.05737 (2015) - [i3]Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller:
Computing the Ramsey Number R(4, 3, 3) using Abstraction and Symmetry breaking. CoRR abs/1510.08266 (2015) - 2014
- [c1]Michael Codish
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). ICTAI 2014: 186-193 - [i2]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten). CoRR abs/1405.5754 (2014) - [i1]Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller:
Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30. CoRR abs/1409.5189 (2014)
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-11-15 19:30 CET 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: