default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrfansha Shaik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Irfansha Shaik
, Jaco van de Pol:
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation. ECAI 2024: 4207-4215- [c5]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. SAT 2024: 26:1-26:18 - [i7]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. CoRR abs/2403.11598 (2024) - [i6]Irfansha Shaik, Jaco van de Pol:
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation. CoRR abs/2408.04349 (2024) - 2023
- [c4]Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol, Abdallah Saffidine:
Implicit QBF Encodings for Positional Games. ACG 2023: 133-145 - [c3]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Quantum Circuits as Classical Planning. ICCAD 2023: 1-9 - [c2]Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol:
Validation of QBF Encodings with Winning Strategies. SAT 2023: 24:1-24:10 - [d2]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Artifact for Paper Search-Space Pruning with Int-Splits for Faster QBF Solving. Zenodo, 2023
- [i5]Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol, Abdallah Saffidine:
Implicit State and Goals in QBF Encodings for Positional Games (extended version). CoRR abs/2301.07345 (2023) - [i4]Irfansha Shaik, Jaco van de Pol:
Concise QBF Encodings for Games on a Grid (extended version). CoRR abs/2303.16949 (2023) - [i3]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Search-Space Pruning with Int-Splits for Faster QBF Solving. CoRR abs/2304.08308 (2023) - [i2]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Quantum Circuits as Classical Planning. CoRR abs/2304.12014 (2023) - 2022
- [c1]Irfansha Shaik, Jaco van de Pol:
Classical Planning as QBF without Grounding. ICAPS 2022: 329-337 - [d1]Irfansha Shaik, Jaco van de Pol:
Code, Benchmarks, Data from the ICAPS 2022 paper "Classical Planning as QBF without Grounding". Zenodo, 2022 - 2021
- [i1]Irfansha Shaik, Jaco van de Pol:
Classical Planning as QBF without Grounding (extended version). CoRR abs/2106.10138 (2021)
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-07 20:35 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:
