Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMichael Young
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j25]Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young:
The inverse eigenvalue problem of a graph: Multiplicities and minors. J. Comb. Theory, Ser. B 142: 276-306 (2020)
2010 – 2019
- 2019
- [j24]Lisa Vangsness
, Michael Young:
Central and Peripheral Cues to Difficulty in a Dynamic Task. Human Factors 61(5) (2019) - [j23]Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic Colorings on the Integers. Integers 19: A18 (2019) - [c21]Mahdieh Nejati Javaremi, Michael Young, Brenna D. Argall:
Interface Operation and Implications for Shared-Control Assistive Robots. ICORR 2019: 232-239 - [c20]Michael Young, Christopher Miller, Youyi Bi, Wei Chen, Brenna D. Argall:
Formalized Task Characterization for Human-Robot Autonomy Allocation. ICRA 2019: 6044-6050 - [c19]Michael Young, Mahdieh Nejati Javaremi, Brenna D. Argall:
Discrete N-Dimensional Entropy of Behavior: DNDEB. IROS 2019: 2227-2233 - 2018
- [j22]Jessica De Silva, Kristin Heysse, Adam Kapilow, Anna Schenfisch, Michael Young:
Turán numbers of vertex-disjoint cliques in -partite graphs. Discret. Math. 341(2): 492-496 (2018) - [j21]Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
The relationship between k-forcing and k-power domination. Discret. Math. 341(6): 1789-1797 (2018) - [j20]Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. Journal of Graph Theory 87(4): 660-671 (2018) - 2017
- [j19]Zhanar Berikkyzy, Alex Shulte, Michael Young:
Anti-van der Waerden Numbers of 3-Term Arithmetic Progression. Electr. J. Comb. 24(2): P2.39 (2017) - [j18]Adam H. Berliner, Chassidy Bozeman, Steve Butler, Minerva Catral, Leslie Hogben, Brenda Kroschel, Jephian C.-H. Lin, Nathan Warnberg, Michael Young:
Zero forcing propagation time on oriented graphs. Discret. Appl. Math. 224: 45-59 (2017) - [j17]Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
Note on power propagation time and lower bounds for the power domination number. J. Comb. Optim. 34(3): 736-741 (2017) - [j16]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
Rainbow triangles in three-colored graphs. J. Comb. Theory, Ser. B 126: 83-113 (2017) - [j15]Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young:
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. Journal of Graph Theory 84(4): 552-565 (2017) - [c18]Michael Young, Mahdieh Nejati, Ahmetcan Erdogan, Brenna D. Argall:
An Analysis of Degraded Communication Channels in Human-Robot Teaming and Implications for Dynamic Autonomy Allocation. FSR 2017: 665-679 - 2016
- [j14]Leslie Hogben, Kevin F. Palmowski, David E. Roberson, Michael Young:
Fractional zero forcing via three-color forcing games. Discret. Appl. Math. 213: 114-129 (2016) - [c17]Shreya Kumar, Charles Wallace, Michael Young:
Mentoring trajectories in an evolving agile workplace. ICSE (Companion Volume) 2016: 142-151 - 2015
- [j13]Matthias Beck, Daniel Blado, Joseph Crawford, Taïna Jean-Louis, Michael Young:
On Weak Chromatic Polynomials of Mixed Graphs. Graphs and Combinatorics 31(1): 91-98 (2015) - [j12]Daniel Burgarth, Vittorio Giovannetti, Leslie Hogben, Simone Severini, Michael Young:
Logic circuits from zero forcing. Nat. Comput. 14(3): 485-490 (2015) - [c16]D. Sculley, Gary Holt, Daniel Golovin, Eugene Davydov, Todd Phillips, Dietmar Ebner, Vinay Chaudhary, Michael Young, Jean-François Crespo, Dan Dennison:
Hidden Technical Debt in Machine Learning Systems. NIPS 2015: 2503-2511 - 2014
- [c15]Nick Levine, Michael Young:
Leadership Trait Analysis and Threat Assessment with Profiler Plus. ILC 2014: 50 - 2013
- [j11]Steve Butler, Michael Young:
Throttling zero force propagation speed on graphs. Australas. J Comb. 57: 65-72 (2013) - [j10]Lale Özkahya, Michael Young:
Anti-Ramsey number of matchings in hypergraphs. Discret. Math. 313(20): 2359-2364 (2013) - [j9]James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young:
Monochromatic triangles in three-coloured graphs. J. Comb. Theory, Ser. B 103(4): 489-503 (2013) - [j8]Lucas Kramer, Ryan R. Martin, Michael Young:
On diamond-free subposets of the Boolean lattice. J. Comb. Theory, Ser. A 120(3): 545-560 (2013) - [j7]Daniel Burgarth, D. D'Alessandro, Leslie Hogben, Simone Severini, Michael Young:
Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks. IEEE Trans. Autom. Control. 58(9): 2349-2354 (2013) - [c14]Marc J. Buehner, David A. Lagnado, Christos Bechlivanidis, Marc O. Ernst, Marieke Rohde, Michael Young:
Time and Causality: Mutual Constraints; Insights from Event and Time Perception, Motor Control, and Gaming. CogSci 2013 - [c13]Rajiv Saigal, Elisa Cimetta, Nina Tandon, Jing Zhou, Robert Langer, Michael Young, Gordana Vunjak-Novakovic, Stephen Redenti:
Electrical stimulation via a biocompatible conductive polymer directs retinal progenitor cell differentiation. EMBC 2013: 1627-1631 - [c12]Daniel Golovin, D. Sculley, H. Brendan McMahan, Michael Young:
Large-Scale Learning with Less RAM via Randomization. ICML (2) 2013: 325-333 - [c11]H. Brendan McMahan, Gary Holt, David Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Dan Liu, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, Jeremy Kubica:
Ad click prediction: a view from the trenches. KDD 2013: 1222-1230 - [i3]Daniel Golovin, D. Sculley, H. Brendan McMahan, Michael Young:
Large-Scale Learning with Less RAM via Randomization. CoRR abs/1303.4664 (2013) - 2012
- [j6]Leslie Hogben, My Huynh, Nicole Kingsley, Sarah Meyer, Shanise Walker, Michael Young:
Propagation time for zero forcing on a graph. Discret. Appl. Math. 160(13-14): 1994-2005 (2012) - [j5]Ruth Haas, Michael Young:
The anti-Ramsey number of perfect matching. Discret. Math. 312(5): 933-937 (2012) - 2011
- [j4]sarah-marie belcastro, Michael Young:
1-factor covers of regular graphs. Discret. Appl. Math. 159(5): 281-287 (2011) - [i2]Daniel Burgarth, Vittorio Giovannetti, Leslie Hogben, Simone Severini, Michael Young:
Logic circuits from zero forcing. CoRR abs/1106.4403 (2011) - 2010
- [c10]Michael Young, Oliver Bown:
Clap-along: A Negotiation Strategy for Creative Musical Interaction with Computational Systems. ICCC 2010: 215-222 - [p1]Michael Young, Nick Bilton:
A Day in the Life of the New York Times. Beautiful Visualization 2010: 271-290
2000 – 2009
- 2009
- [j3]Huan Liu, John J. Salerno, Michael Young, Rakesh Agrawal, Philip S. Yu:
Introduction to special issue on social computing, behavioral modeling, and prediction. ACM Trans. Knowl. Discov. Data 3(2): 6:1-6:3 (2009) - [i1]Michael Young:
Creative Computers, Improvisation and Intimacy. Computational Creativity: An Interdisciplinary Approach 2009 - 2008
- [c9]Michael Young, John Drever, Mick Grierson, Ian Stonehouse:
Goldsmiths Electronic Music Studios: 40 Years. ICMC 2008 - 2007
- [c8]Michael Young:
NN Music: Improvising with a 'Living' Computer. CMMR 2007: 337-350 - [c7]Michael Young:
Nn Music: improvising with a 'Living' Computer. ICMC 2007 - 2005
- [c6]Ross D. King, Michael Young, Amanda Clare, Kenneth Whelan, Jem J. Rowland:
The Robot Scientist Project. Discovery Science 2005: 16-25 - 2004
- [c5]Tim Blackwell, Michael Young:
Swarm Granulator. EvoWorkshops 2004: 399-408
1990 – 1999
- 1993
- [j2]Michael Young, David L. Levine, Richard N. Taylor:
Comments on "Temporal Logic-Based Deadlock Analysis for Ada''. IEEE Trans. Software Eng. 19(2): 198-200 (1993)
1980 – 1989
- 1988
- [j1]Richard F. Rashid, Avadis Tevanian, Michael Young, David B. Golub, Robert V. Baron, David L. Black, William J. Bolosky, Jonathan Chew:
Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures. IEEE Trans. Computers 37(8): 896-907 (1988) - 1987
- [c4]Richard F. Rashid, Avadis Tevanian, Michael Young, David B. Golub, Robert V. Baron, David L. Black, William J. Bolosky, Jonathan Chew:
Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures. ASPLOS 1987: 31-39 - [c3]Michael Young, Avadis Tevanian, Richard F. Rashid, David B. Golub, Jeffrey L. Eppinger, Jonathan Chew, William J. Bolosky, David L. Black, Robert V. Baron:
The Duality of Memory and Communication in the Implementation of a Multiprocessor Operating System. SOSP 1987: 63-76 - [c2]Avadis Tevanian, Richard F. Rashid, Michael Young, David B. Golub, Mary R. Thompson, William J. Bolosky, Richard Sanzi:
A UNIX Interface for Shared Memory and Memory Mapped Files Under Mach. USENIX Summer 1987: 53-68 - 1986
- [c1]Michael J. Accetta, Robert V. Baron, William J. Bolosky, David B. Golub, Richard F. Rashid, Avadis Tevanian, Michael Young:
Mach: A New Kernel Foundation for UNIX Development. USENIX Summer 1986: 93-113
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-22 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
