Остановите войну!
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
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 67 matches
- 2024
- Nathan Nakamura, Paul Szypryt, Amber L. Dagel, Bradley K. Alpert, Douglas A. Bennett, William Bertrand Doriese, Malcolm Durkin, Joseph W. Fowler, Dylan T. Fox, Johnathon D. Gard, Ryan N. Goodner, James Zachariah Harris, Gene C. Hilton, Edward S. Jimenez, Burke L. Kernen, Kurt W. Larson, Zachary H. Levine, Daniel McArthur, Kelsey M. Morgan, Galen C. O'Neil, Nathan J. Ortiz, Christine G. Pappas, Carl D. Reintsema, Daniel R. Schmidt, Peter A. Schultz, Kyle R. Thompson, Joel N. Ullom, Leila Vale, Courtenay T. Vaughan, Christopher Walker, Joel C. Weber, Jason W. Wheeler, Daniel S. Swetz:
Nanoscale Three-Dimensional Imaging of Integrated Circuits Using a Scanning Electron Microscope and Transition-Edge Sensor Spectrometer. Sensors 24(9): 2890 (2024) - 2023
- Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023) - Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. ACM Trans. Algorithms 19(2): 13:1-13:22 (2023) - Yusheng Bian, Hanyi Ding, Abdelsalam Aboketaf, Vaishnavi Karra, Massimo Sorbara, Takako Hirokawa, Salman Mosleh, Crystal Hedges, Won Suk Lee, Sujith Chandran, Avijit Chatterjee, Riddhi Nandi, Ken Giewont, Karen Nummy, Alon Gabbay, Yannick De Koninck, Jochem Verbist, Santiago Echeverri, Liron Gantz, Qidi Liu, Dylan Logan, Omid Jafari, Kyle Murray, Edgar Huante-Ceron, Subharup Roy, Paul Webster-Pact, Michal Rakowski, Kevin K. Dezfulian, Andy Stricker, Thomas Houghton, Keith Donegan, Ryan Sporer, Jae Kyu Cho, Farid Barakat, Dan Moy, Zhuo-Jie Wu, Subramanian Krishnamurthy, Arman Najafi, Seyedeh Fahimeh Banihashemian, Rick Mincar, Ranjani Sirdeshmukh, Norman Robson, Ian Melville, Rod Augur, Jae Gon Lee, Wenhe Lin, George Gifford, Robert Fox, Vikas Gupta, Anthony Yu, John Pellerin, Ted Letavic:
Polarization mode dispersion in CMOS-integrated monolithic SiPh components: simulations and experiments. OFC 2023: 1-3 - Ross Gruetzemacher, Alan Chan, Kevin Frazier, Christy Manning, Stepán Los, James Fox, José Hernández-Orallo, John Burden, Matija Franklin, Clíodhna Ní Ghuidhir, Mark M. Bailey, Daniel Eth, Toby Pilditch, Kyle A. Kilian:
An International Consortium for Evaluations of Societal-Scale Risks from Advanced AI. CoRR abs/2310.14455 (2023) - 2022
- Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. Algorithmica 84(9): 2395-2413 (2022) - Kyle Fox, Jiashuai Lu:
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread. J. Comput. Geom. 13(1) (2022) - Kyle Fox, Hongyao Huang, Benjamin Raichel:
Clustering with Faulty Centers. ISAAC 2022: 10:1-10:14 - Kyle Fox, Thomas Stanley:
Computation of Cycle Bases in Surface Embedded Graphs. ISAAC 2022: 13:1-13:13 - Kyle Fox, Jiashuai Lu:
A deterministic near-linear time approximation scheme for geometric transportation. CoRR abs/2211.03891 (2022) - 2021
- Andrew S. Fox, Daniel Holley, Peter Christiaan Klink, Spencer A. Arbuckle, Carol A. Barnes, Jörn Diedrichsen, Sze Chai Kwok, Colin Kyle, J. Andrew Pruszynski, Jakob Seidlitz, XuFeng Zhou, Russell A. Poldrack, Krzysztof J. Gorgolewski:
Sharing voxelwise neuroimaging results from rhesus monkeys and other species with Neurovault. NeuroImage 225: 117518 (2021) - Connor Colombe, Kyle Fox:
Approximating the (Continuous) Fréchet Distance. SoCG 2021: 26:1-26:14 - Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes:
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. ISAAC 2021: 72:1-72:16 - 2020
- Ka Yaw Teo, Ovidiu Daescu, Kyle Fox:
Trajectory planning for an articulated probe. Comput. Geom. 90: 101655 (2020) - Kyle Fox, Jiashuai Lu:
A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread. SoCG 2020: 45:1-45:18 - Connor Colombe, Kyle Fox:
Approximating the (continuous) Fréchet distance. CoRR abs/2007.07994 (2020) - 2019
- Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81(9): 3746-3764 (2019) - Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. ISAAC 2019: 23:1-23:16 - Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. SODA 2019: 881-896 - Pankaj K. Agarwal, Esther Ezra, Kyle Fox:
Geometric Optimization Revisited. Computing and Software Science 2019: 66-84 - Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. CoRR abs/1903.08263 (2019) - Kyle Swanson, Lili Yu, Christopher Fox, Jeremy Wohlwend, Tao Lei:
Building a Production Model for Retrieval-Based Chatbots. CoRR abs/1906.03209 (2019) - Kyle Fox, Jiashuai Lu:
A near-linear time approximation scheme for geometric transportation with real supplies. CoRR abs/1907.04426 (2019) - Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. CoRR abs/1910.00773 (2019) - Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - 2018
- Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ACM Trans. Algorithms 14(2): 24:1-24:20 (2018) - Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. ACM Trans. Algorithms 14(4): 46:1-46:21 (2018) - Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - Ovidiu Daescu, Kyle Fox, Ka Yaw Teo:
Trajectory Planning for an Articulated Probe. CCCG 2018: 296-303 - Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan, Erin Taylor:
Subtrajectory Clustering: Models and Algorithms. PODS 2018: 75-87
skipping 37 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-06-20 02:43 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