default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Furcy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]David Furcy, Scott M. Summers:
Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares. CoRR abs/2408.06241 (2024)- 2023
- [j10]David Furcy, Scott M. Summers, Logan Withers:
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D. Theory Comput. Syst. 67(5): 1082-1130 (2023) - [c16]David Furcy, Scott M. Summers, Hailey Vadnais:
Tight Bounds on the Directed Tile Complexity of a Just-Barely 3D 2 ˟ N Rectangle at Temperature 1. UCNC 2023: 79-93 - 2021
- [j9]David Furcy, Scott M. Summers, Christian Wendlandt:
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D. Theor. Comput. Sci. 872: 55-78 (2021) - [j8]Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz
, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
On the effects of hierarchical self-assembly for reducing program-size complexity. Theor. Comput. Sci. 894: 50-78 (2021) - [c15]David Furcy, Scott M. Summers, Logan Withers:
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D. DNA 2021: 4:1-4:18 - 2020
- [i6]David Furcy, Scott M. Summers, Logan Withers:
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D. CoRR abs/2007.11093 (2020)
2010 – 2019
- 2019
- [c14]David Furcy, Scott M. Summers, Christian Wendlandt:
New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1. DNA 2019: 100-119 - 2018
- [j7]David Furcy, Scott M. Summers:
Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D. Algorithmica 80(6): 1909-1963 (2018) - [i5]David Furcy, Scott M. Summers, Christian Wendlandt:
Self-assembly of, and optimal encoding inside, thin rectangles at temperature-1 in 3D. CoRR abs/1808.04358 (2018) - 2017
- [j6]David Furcy, Samuel Micka, Scott M. Summers:
Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D. Algorithmica 77(4): 1240-1282 (2017) - [j5]David Furcy, Scott M. Summers:
Scaled pier fractals do not strictly self-assemble. Nat. Comput. 16(2): 317-338 (2017) - 2015
- [c13]David Furcy, Scott M. Summers:
Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D. COCOA 2015: 138-151 - [c12]David Furcy, Samuel Micka, Scott M. Summers:
Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D. DNA 2015: 71-86 - [i4]David Furcy, Scott M. Summers:
Optimal self-assembly of finite shapes at temperature 1 in 3D. CoRR abs/1507.06365 (2015) - 2014
- [c11]Kimberly Barth, David Furcy, Scott M. Summers, Paul Totzke:
Scaled Tree Fractals Do not Strictly Self-assemble. UCNC 2014: 27-39 - [i3]David Furcy, Scott M. Summers:
Scaled pier fractals do not strictly self-assemble. CoRR abs/1406.4197 (2014) - [i2]David Furcy, Samuel Micka, Scott M. Summers:
Optimal program-size complexity for self-assembly at temperature 1 in 3D. CoRR abs/1411.1122 (2014) - [i1]Kimberly Barth, David Furcy, Scott M. Summers, Paul Totzke:
Scaled tree fractals do not strictly self-assemble. CoRR abs/1411.3044 (2014) - 2011
- [c10]David Furcy, George Thomas:
Designing Effective Heterogeneous Teams for Multiagent Routing Domains. IAT 2011: 341-348
2000 – 2009
- 2009
- [j4]Razvan C. Bunescu, Vitor R. Carvalho, Jan Chomicki, Vincent Conitzer, Michael T. Cox, Virginia Dignum, Zachary Dodds, Mark Dredze, David Furcy, Evgeniy Gabrilovich, Mehmet H. Göker, Hans W. Guesgen, Haym Hirsh, Dietmar Jannach, Ulrich Junker, Wolfgang Ketter, Alfred Kobsa, Sven Koenig, Tessa A. Lau, Lundy Lewis, Eric T. Matson, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Joelle Pineau, Pascal Poupart, Anita Raja, Wheeler Ruml, Norman M. Sadeh, Guy Shani, Daniel G. Shapiro, Sarabjot Singh Anand, Matthew E. Taylor, Kiri Wagstaff, Trey Smith, William E. Walsh, Rong Zhou:
AAAI 2008 Workshop Reports. AI Mag. 30(1): 108-118 (2009) - 2008
- [c9]David Furcy, Thomas L. Naps, Jason Wentworth:
Sorting out sorting: the sequel. ITiCSE 2008: 174-178 - 2007
- [c8]David Furcy, Andrew Jungwirth, Thomas L. Naps:
BlockTree - Pedagogical Information Visualization for Heuristic Search. FLAIRS 2007: 303-308 - 2006
- [j3]Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam, David Furcy:
Maximizing over multiple pattern databases speeds up heuristic search. Artif. Intell. 170(16-17): 1123-1136 (2006) - 2005
- [c7]David Furcy, Sven Koenig:
Limited Discrepancy Beam Search. IJCAI 2005: 125-131 - [c6]David Furcy, Sven Koenig:
Scaling up WA* with Commitment and Diversity. IJCAI 2005: 1521-1522 - 2004
- [b1]David Furcy:
Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search. Georgia Institute of Technology, Atlanta, GA, USA, 2004 - [j2]Sven Koenig, Maxim Likhachev, David Furcy:
Lifelong Planning A. Artif. Intell. 155(1-2): 93-146 (2004) - [j1]Sven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy:
Incremental Heuristic Search in AI. AI Mag. 25(2): 99-112 (2004) - [c5]Robert C. Holte, Jack Newton, Ariel Felner, Ram Meshulam, David Furcy:
Multiple Pattern Databases. ICAPS 2004: 122-131 - 2002
- [c4]Yaxin Liu, Sven Koenig, David Furcy:
Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. AAAI/IAAI 2002: 484-491 - [c3]Sven Koenig, David Furcy, Colin Bauer:
Heuristic Search-Based Replanning. AIPS 2002: 294-301 - 2000
- [c2]David Furcy, Sven Koenig:
Speeding up the Convergence of Real-Time Search. AAAI/IAAI 2000: 891-897 - [c1]David Furcy:
Using and Learning Abstraction Hierarchies for Planning. SARA 2000: 320-321
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-09-18 23:39 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:
