default search action
Yuliy M. Baryshnikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j27]Yuliy M. Baryshnikov, Caroline J. Klivans, Nicholas Kosar:
On the topology of no k-equal spaces. Adv. Appl. Math. 149: 102538 (2023) - [j26]Yuliy M. Baryshnikov
:
Linear obstacles in linear systems, and ways to avoid them. Adv. Appl. Math. 151: 102579 (2023) - [j25]Yuliy M. Baryshnikov
Topological perplexity of feedback stabilization. J. Appl. Comput. Topol. 7(1): 75-87 (2023) - [i11]Yuliy M. Baryshnikov, Alexander L. Stolyar:
A large-scale particle system with independent jumps and distributed synchronization. CoRR abs/2311.17052 (2023) - 2022
- [j24]Yuliy M. Baryshnikov
Stationary Points at Infinity for Analytic Combinatorics. Found. Comput. Math. 22(5): 1631-1664 (2022) - [i10]Yuliy M. Baryshnikov, Stephen Melczer, Robin Pemantle:
Asymptotics of multivariate sequences IV: generating functions with poles on a hyperplane arrangement. CoRR abs/2207.00717 (2022) - 2020
- [j23]Yuliy M. Baryshnikov
Minimal unimodal decomposition on trees. J. Appl. Comput. Topol. 4(2): 199-209 (2020)
2010 – 2019
- 2019
- [j22]Somayeh Shahsavarani, Ivan T. Abraham
Comparing Cyclicity Analysis With Pre-established Functional Connectivity Methods to Identify Individuals and Subject Groups Using Resting State fMRI. Frontiers Comput. Neurosci. 13: 94 (2019) - [i9]Yuliy M. Baryshnikov
Asymptotics of multivariate sequences in the presence of a lacuna. CoRR abs/1905.04174 (2019) - [i8]Yuliy M. Baryshnikov
Critical points at infinity for analytic combinatorics. CoRR abs/1905.05250 (2019) - 2018
- [j21]Yuliy M. Baryshnikov
Stokes's Theorem, Data, and the Polar Ice Caps. Am. Math. Mon. 125(9): 830-834 (2018) - [c27]Yuliy M. Baryshnikov
Diagonal Asymptotics for Symmetric Rational Functions via ACSV. AofA 2018: 12:1-12:15 - [i7]Yuliy M. Baryshnikov, Stephen Melczer, Robin Pemantle, Armin Straub:
Diagonal asymptotics for symmetric rational functions via ACSV. CoRR abs/1804.10929 (2018) - 2017
- [j20]Yuliy M. Baryshnikov
Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application. SIGMETRICS Perform. Evaluation Rev. 45(2): 39-41 (2017) - [j19]Yuliy M. Baryshnikov
Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application. SIGMETRICS Perform. Evaluation Rev. 45(3): 84-89 (2017) - 2016
- [j18]Yuliy M. Baryshnikov
Types of Markov Fields and Tilings. IEEE Trans. Inf. Theory 62(8): 4361-4375 (2016) - [c26]Yuliy M. Baryshnikov
A design of hybrid feedback stabilization on 1D coverage with topological perspectives. ACC 2016: 5154-5160 - [c25]Yuliy M. Baryshnikov
Cyclicity in multivariate time series and applications to functional MRI data. CDC 2016: 1625-1630 - [c24]Yuliy M. Baryshnikov, Cheng Chen:
Shapes of cyclic pursuit and their evolution. CDC 2016: 2561-2566 - [c23]Yang Chen, Harish Chintakunta, Le Xie
Persistent-homology-based detection of power system low-frequency oscillations using PMUs. GlobalSIP 2016: 796-800 - [c22]Elad Yarkony, Yuliy M. Baryshnikov, Yoram Bresler
Range-space based identification of parametric linear systems. IVMSP 2016: 1-5 - 2015
- [c21]Yuliy M. Baryshnikov
Cyclic vectors of associative matrix algebras and reachability criteria for linear and nonlinear control systems. CDC 2015: 2695-2701 - 2014
- [c20]Maxim Arnold
Cyclic pursuit without coordinates: Convergence to regular polygon formations. CDC 2014: 6191-6196 - [c19]Yuliy M. Baryshnikov
Markov field types and tilings. ISIT 2014: 2639-2643 - [c18]Han Wang, Cheng Chen, Yuliy M. Baryshnikov
A Topological Perspective on Cycling Robots for Full Tree Coverage. WAFR 2014: 659-675 - 2013
- [c17]Yuliy M. Baryshnikov
Robust stability conditions for switched linear systems: Commutator bounds and the Łojasiewicz inequality. CDC 2013: 722-726 - 2012
- [j17]Andrei A. Agrachev, Yuliy M. Baryshnikov
On robust Lie-algebraic stability conditions for switched linear systems. Syst. Control. Lett. 61(2): 347-353 (2012) - [c16]Yuliy M. Baryshnikov
Search on the Brink of Chaos. ANALCO 2012: 65-74 - [c15]Yuliy M. Baryshnikov:
On the structure of the space of networks and traffic patterns. ISCCSP 2012: 1-4 - [c14]Yuliy M. Baryshnikov, Gabriel H. Tucci:
Asymptotic traffic flow in a hyperbolic network. ISCCSP 2012: 1-4 - [c13]Maxim Arnold
Convex Hull Asymptotic Shape Evolution. WAFR 2012: 349-364 - [c12]Yuliy M. Baryshnikov:
IT Security Investment and Gordon-Loeb's 1/e Rule. WEIS 2012 - 2011
- [j16]Yuliy M. Baryshnikov
Minimalist counting in sensor networks (Noise helps). Ad Hoc Networks 9(6): 987-997 (2011) - [j15]Mingji Lou, Edmond A. Jonckheere, Francis Bonahon, Bhaskar Krishnamachari, Yuliy M. Baryshnikov
Load Balancing by Network Curvature Control. Int. J. Comput. Commun. Control 6(1): 134-149 (2011) - [j14]Edmond A. Jonckheere, Mingji Lou, Francis Bonahon
Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks. Internet Math. 7(1): 1-27 (2011) - [j13]Yuliy M. Baryshnikov
CAUCHY localization: a distributed computation of WSNs. SIGMETRICS Perform. Evaluation Rev. 39(2): 59-61 (2011) - [i6]Yuliy M. Baryshnikov, Vadim Zharnitsky:
Search on the Brink of Chaos. CoRR abs/1108.2498 (2011) - [i5]Yuliy M. Baryshnikov, Peter Bubenik, Matthew Kahle:
Min-type Morse theory for configuration spaces of hard spheres. CoRR abs/1108.3061 (2011) - 2010
- [c11]Andrei A. Agrachev, Yuliy M. Baryshnikov
Towards robust Lie-algebraic stability conditions for switched linear systems. CDC 2010: 408-413 - [c10]Djamila Aouada
Mahalanobis-based Adaptive Nonlinear Dimension Reduction. ICPR 2010: 742-745 - [i4]Yuliy M. Baryshnikov, Gabriel H. Tucci:
Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core. CoRR abs/1010.3304 (2010) - [i3]Yuliy M. Baryshnikov, Gabriel H. Tucci:
Asymptotic Traffic Flow in an Hyperbolic Network II: Non-uniform Traffic. CoRR abs/1010.3305 (2010)
2000 – 2009
- 2009
- [j12]Yuliy M. Baryshnikov
Target Enumeration via Euler Characteristic Integrals. SIAM J. Appl. Math. 70(3): 825-844 (2009) - [i2]Edmond A. Jonckheere, Mingji Lou, Francis Bonahon, Yuliy M. Baryshnikov:
Euclidean versus hyperbolic congestion in idealized versus experimental networks. CoRR abs/0911.2538 (2009) - 2008
- [j11]Yuliy M. Baryshnikov
Modeling market dynamics in competitive communication consumer markets. Bell Labs Tech. J. 13(2): 193-208 (2008) - [j10]Kyung Joon Kwak, Yuliy M. Baryshnikov
Self-assembling sweep-and-sleep sensor systems. SIGMETRICS Perform. Evaluation Rev. 36(2): 131-133 (2008) - [c9]Yuliy M. Baryshnikov
Stochastic Counting in Sensor Networks, or: Noise Is Good. DCOSS 2008: 32-45 - [c8]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak:
High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata. IPSN 2008: 517-526 - [c7]Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.:
Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks. IPSN 2008: 535-536 - [c6]Robert Ghrist, Yuliy M. Baryshnikov
Target Enumeration via Integration over Planar Sensor Networks. Robotics: Science and Systems 2008 - [c5]Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.:
Self-Organizing Sleep-Wake Sensor Systems. SASO 2008: 393-402 - 2007
- [c4]Yuliy M. Baryshnikov
Localization for Anchoritic Sensor Networks. DCOSS 2007: 82-95 - 2006
- [j9]Yuliy M. Baryshnikov
Free-Drop TCP. SIGMETRICS Perform. Evaluation Rev. 34(3): 33-35 (2006) - [c3]Yuliy M. Baryshnikov
On Times to Compute Shapes in 2D Tile Self-assembly. DNA 2006: 215-222 - [i1]Yuliy M. Baryshnikov, Jian Tan:
Localization for Anchoritic Sensor Networks. CoRR abs/cs/0608014 (2006) - 2005
- [c2]Yuliy M. Baryshnikov
Self-correcting Self-assembly: Growth Models and the Hammersley Process. DNA 2005: 1-11 - 2004
- [j8]Yuliy M. Baryshnikov
Flood search under the California Split rule. Oper. Res. Lett. 32(3): 199-206 (2004) - [j7]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic:
Self assembly times in DNA-based computation. SIGMETRICS Perform. Evaluation Rev. 32(2): 35-37 (2004) - [c1]Yuliy M. Baryshnikov
DNA-Based Computation Times. DNA 2004: 14-23 - 2003
- [j6]Lachlan L. H. Andrew, Yuliy M. Baryshnikov
An asymptotically optimal greedy algorithm for large optical burst switching systems. SIGMETRICS Perform. Evaluation Rev. 31(2): 14-16 (2003) - 2002
- [j5]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein:
Flood search under the California split strategy. SIGMETRICS Perform. Evaluation Rev. 30(3): 15-16 (2002) - 2001
- [j4]Yuliy M. Baryshnikov
Kelly's LAN model revisited. SIGMETRICS Perform. Evaluation Rev. 29(3): 28-29 (2001)
1990 – 1999
- 1997
- [j3]Yuliy M. Baryshnikov
Gaussian Samples, Regular Simplices, and Exchangeability. Discret. Comput. Geom. 17(3): 257-261 (1997) - 1994
- [j2]Yuliy M. Baryshnikov
Regular Simplices and Gaussian Samples. Discret. Comput. Geom. 11: 141-147 (1994)
1980 – 1989
- 1986
- [j1]Boris A. Berezovskiy, Yuliy M. Baryshnikov
On a class of best-choice problems. Inf. Sci. 39(1): 111-127 (1986)
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-04-25 05:38 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: