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
- Jack Edmonds 0001
aka: Jack R. Edmonds
University of Waterloo, Department of Combinatorics and Optimization, ON, Canada - Jack Edmonds 0002
Santa Clara University, Department of Electrical and Computer Engineering, Santa Clara, CA, USA
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 41 matches
- 2023
- Sara Tehranipoor, Nima Karimian, Jack Edmonds:
Breaking AES-128: Machine Learning-Based SCA Under Different Scenarios and Devices. CSR 2023: 564-571 - 2022
- Kathie Cameron, Jack Edmonds:
A PPA parity theorem about trees in a bipartite graph. Discret. Appl. Math. 308: 107-110 (2022) - Hossein Sayadi, Mehrdad Aliasgari, Furkan Aydin, Seetal Potluri, Aydin Aysu, Jack Edmonds, Sara Tehranipoor:
Towards AI-Enabled Hardware Security: Challenges and Opportunities. IOLTS 2022: 1-10 - 2021
- Holden Gordon, Jack Edmonds, Soroor Ghandali, Wei Yan, Nima Karimian, Fatemeh Tehranipoor:
Flash-Based Security Primitives: Evolution, Challenges and Future Directions. Cryptogr. 5(1): 7 (2021) - Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu:
Understanding PPA-completeness. J. Comput. Syst. Sci. 115: 146-168 (2021) - Steve C. N. Hui, Mark Mikkelsen, Helge J. Zöllner, Vishwadeep Ahluwalia, Sarael Alcauter, Laima Baltusis, Deborah A. Barany, Laura R. Barlow, Robert Becker, Jeffrey I. Berman, Adam Berrington, Pallab K. Bhattacharyya, Jakob Udby Blicher, Wolfgang Bogner, Mark S. Brown, Vince D. Calhoun, Ryan Castillo, Kim M. Cecil, Richard A. E. Edden, Yeo Bi Choi, Winnie C. W. Chu, William T. Clarke, Alexander R. Craven, Koen Cuypers, Michael Dacko, Camilo de la Fuente-Sandoval, Patricia Desmond, Aleksandra Domagalik, Julien Dumont, Niall W. Duncan, Ulrike Dydak, Katherine Dyke, David A. Edmondson, Gabriele Ende, Lars Ersland, C. John Evans, Alan S. R. Fermin, Antonio Ferretti, Ariane Fillmer, Tao Gong, Ian Greenhouse, James T. Grist, Meng Gu, Ashley D. Harris, Katarzyna Hat, Stefanie Heba, Eva Heckova, John P. Hegarty, Kirstin-Friederike Heise, Shiori Honda, Aaron Jacobson, Jacobus F. A. Jansen, Christopher W. Jenkins, Stephen J. Johnston, Christoph Juchem, Alayar Kangarlu, Adam B. Kerr, Karl Landheer, Thomas Lange, Phil Lee, Swati Rane Levendovszky, Catherine Limperopoulos, Feng Liu, William Lloyd, David J. Lythgoe, Maro G. Machizawa, Erin L. MacMillan, Richard J. Maddock, Andrei V. Manzhurtsev, María L. Martinez-Gudino, Jack J. Miller, Heline Mirzakhanian, Marta Moreno-Ortega, Paul G. Mullins, Shinichiro Nakajima, Jamie Near, Ralph Noeske, Wibeke Nordhøy, Georg Oeltzschner, Raul Osorio-Duran, María Concepción García Otaduy, Erick H. Pasaye, Ronald Peeters, Scott J. Peltier, Ulrich Pilatus, Nenad Polomac, Eric C. Porges, Subechhya Pradhan, James Joseph Prisciandaro, Nicolaas A. Puts, Caroline D. Rae, Francisco Reyes-Madrigal, Timothy P. L. Roberts, Caroline E. Robertson, Jens T. Rosenberg, Diana-Georgiana Rotaru, Ruth L. O'Gorman Tuura, Muhammad G. Saleh, Kristian Sandberg, Ryan Sangill, Keith Schembri, Anouk Schrantee, Natalia A. Semenova, Debra Singel, Rouslan Sitnikov, Jolinda Smith, Yulu Song, Craig E. L. Stark, Diederick Stoffers, Stephan P. Swinnen, Rongwen Tain, Costin Tanase, Sofie Tapper, Martin Tegenthoff, Thomas Thiel, Marc Thioux, Peter Truong, Pim van Dijk, Nolan Vella, Rishma Vidyasagar, Andrej Vovk, Guangbin Wang, Lars T. Westlye, Timothy K. Wilbur, William R. Willoughby, Martin Wilson, Hans-Jörg Wittsack, Adam J. Woods, Yen-Chien Wu, Junqian Xu, Maria Yanez Lopez, David Ka Wai Yeung, Qun Zhao, Xiaopeng Zhou, Gasper Zupan:
Frequency drift in MR spectroscopy at 3T. NeuroImage 241: 118430 (2021) - 2020
- Jack Edmonds, Fatemeh Tehranipoor:
Attacks on Lightweight Hardware-Based Security Primitives. CoRR abs/2011.13450 (2020) - 2018
- Hyun Jung, Christian Suloway, Tianyi Miao, Elijah F. Edmondson, David R. Morcock, Claire Deleage, Yanling Liu, Jack R. Collins, Curtis Lisle:
Integration of Deep Learning and Graph Theory for Analyzing Histopathology Whole-slide Images. AIPR 2018: 1-5 - 2016
- Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu:
Understanding PPA-Completeness. CCC 2016: 23:1-23:25 - 2014
- Jack Edmonds, Laura Sanità:
Exponentiality of the exchange algorithm for finding another room-partitioning. Discret. Appl. Math. 164: 86-91 (2014) - 2010
- Jack Edmonds:
Euler Complexes (Oiks). Electron. Notes Discret. Math. 36: 1289-1293 (2010) - Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Sperner Oiks. Electron. Notes Discret. Math. 36: 1273-1280 (2010) - Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Scarf Oiks. Electron. Notes Discret. Math. 36: 1281-1288 (2010) - Jack Edmonds, Laura Sanità:
On Finding Another Room-Partitioning of the Vertices. Electron. Notes Discret. Math. 36: 1257-1264 (2010) - Jack Edmonds:
Matroid Partition. 50 Years of Integer Programming 2010: 199-217 - 2009
- Jack Edmonds:
Branching Systems. IWOCA 2009: 1 - 2008
- Kathie Cameron, Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph. Discret. Optim. 5(2): 290-292 (2008) - Jack Edmonds:
On Finding Another. Electron. Notes Discret. Math. 31: 181-182 (2008) - Jack Edmonds:
Euler Complexes. Bonn Workshop of Combinatorial Optimization 2008: 65-68 - 2005
- Kathie Cameron, Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly. Electron. Notes Discret. Math. 22: 553-556 (2005) - Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. CoRR abs/cs/0509023 (2005) - 2003
- Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3 [contents] - 2001
- Jack Edmonds:
Redundancy and Helly. Eur. J. Comb. 22(5): 679-685 (2001) - Jack Edmonds:
Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial Optimization 2001: 11-26 - Jack Edmonds, Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs. Combinatorial Optimization 2001: 27-30 - Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization 2001: 31-33 - Surprise Session for Jack Edmonds, "Eureka - You Shrink!". Combinatorial Optimization 2001: 1-10
- 1999
- Kathie Cameron, Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes. SODA 1999: 872 - 1997
- Jack Edmonds, Monique Laurent, Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids. Discret. Math. 165-166: 219-226 (1997) - Kathie Cameron, Jack Edmonds:
Lambda composition. J. Graph Theory 26(1): 9-16 (1997)
skipping 11 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-09-15 16:58 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