default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmand M. Makowski
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j36]Siddharth Pal
, Armand M. Makowski:
Asymptotic Degree Distributions in Large (Homogeneous) Random Networks: A Little Theory and a Counterexample. IEEE Trans. Netw. Sci. Eng. 7(3): 1531-1544 (2020)- 2017
- [j35]Ane Izagirre, Armand M. Makowski:
Light traffic behavior under the power-of-two load balancing strategy: The case of heterogeneous servers. Perform. Evaluation 116: 26-52 (2017) - 2016
- [j34]Osman Yagan, Armand M. Makowski:
Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings? IEEE/ACM Trans. Netw. 24(6): 3383-3396 (2016) - 2014
- [j33]Ane Izagirre, Armand M. Makowski:
Light traffic performance under the power of two load balancing strategy: the case of server heterogeneity. SIGMETRICS Perform. Evaluation Rev. 42(2): 18-20 (2014) - 2013
- [j32]Armand M. Makowski, Guang Han:
On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension. Found. Trends Netw. 6(4): 287-399 (2013) - [j31]Armand M. Makowski, Osman Yagan:
Scaling Laws for Connectivity in Random Threshold Graph Models with Non-Negative Fitness Variables. IEEE J. Sel. Areas Commun. 31(9-Supplement): 573-583 (2013) - [j30]Osman Yagan, Armand M. Makowski:
On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes. Perform. Evaluation 70(7-8): 493-512 (2013) - [j29]Osman Yagan, Armand M. Makowski:
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links. IEEE Trans. Inf. Theory 59(3): 1740-1760 (2013) - [j28]Osman Yagan, Armand M. Makowski:
On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution. IEEE Trans. Inf. Theory 59(9): 5754-5762 (2013) - 2012
- [j27]Guang Han, Armand M. Makowski:
One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity. Queueing Syst. Theory Appl. 72(1-2): 103-138 (2012) - [j26]Osman Yagan, Armand M. Makowski:
Zero-One Laws for Connectivity in Random Key Graphs. IEEE Trans. Inf. Theory 58(5): 2983-2999 (2012) - 2009
- [j25]Guang Han, Armand M. Makowski:
Sensitivity of Critical Transmission Ranges to Node Placement Distributions. IEEE J. Sel. Areas Commun. 27(7): 1066-1077 (2009) - [j24]Guang Han, Armand M. Makowski:
One-dimensional geometric random graphs with nonvanishing densities: part I: a strong zero-one law for connectivity. IEEE Trans. Inf. Theory 55(12): 5832-5839 (2009) - 2008
- [j23]Konstantinos P. Tsoukatos, Armand M. Makowski:
Power-law vs exponential queueing in a network traffic model. Perform. Evaluation 65(1): 32-50 (2008) - 2007
- [j22]Guang Han, Armand M. Makowski:
A very strong zero-one law for connectivity in one-dimensional geometric random graphs. IEEE Commun. Lett. 11(1): 55-57 (2007) - 2006
- [j21]Yijie Han, Richard J. La, Armand M. Makowski, Seungjoon Lee:
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue. Comput. Networks 50(12): 1887-1900 (2006) - [j20]Konstantinos P. Tsoukatos, Armand M. Makowski:
Asymptotic optimality of the Round-Robin policy in multipath routing with resequencing. Queueing Syst. Theory Appl. 52(3): 199-214 (2006) - [j19]Peerapol Tinnakornsrisuphap, Armand M. Makowski:
On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems. Queueing Syst. Theory Appl. 52(4): 287-304 (2006) - [j18]Armand M. Makowski:
On the Optimality of Uniform Pulse Amplitude Modulation. IEEE Trans. Inf. Theory 52(12): 5546-5549 (2006) - 2005
- [j17]Omri Bahat, Armand M. Makowski:
Measuring consistency in TTL-based caches. Perform. Evaluation 62(1-4): 439-455 (2005) - 2002
- [j16]Armand M. Makowski:
Long-range dependence does not necessarily imply non-exponential tails. IEEE Commun. Lett. 6(12): 550-552 (2002) - 2001
- [j15]Lei Kuang, Armand M. Makowski:
Convex stability and asymptotic convex ordering for non-stationary arrival processes. SIGMETRICS Perform. Evaluation Rev. 28(4): 22-23 (2001) - 2000
- [j14]Konstantinos P. Tsoukatos, Armand M. Makowski:
Heavy traffic limits associated with input processes. Queueing Syst. Theory Appl. 34(1-4): 101-130 (2000) - 1999
- [j13]Rajeev Agrawal, Armand M. Makowski, Philippe Nain:
On a Reduced Load Equivalence for Fluid Queues Under Subexponentiality. Queueing Syst. Theory Appl. 33(1-3): 5-41 (1999) - [j12]Dye-Jyun Ma, Armand M. Makowski:
Steering policies for controlled Markov chains under a recurrence condition. IEEE Trans. Autom. Control. 44(8): 1583-1587 (1999) - 1998
- [j11]Marwan Krunz, Armand M. Makowski:
Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models. IEEE J. Sel. Areas Commun. 16(5): 733-748 (1998) - [j10]Young B. Kim, Armand M. Makowski:
Simple optimization problems via majorization ordering. IEEE Trans. Autom. Control. 43(3): 438-442 (1998) - 1997
- [j9]Ramin Rezaiifar, Armand M. Makowski:
From Optimal Search Theory to Sequential Paging in Cellular Networks. IEEE J. Sel. Areas Commun. 15(7): 1253-1264 (1997) - [j8]Minothi Parulekar, Armand M. Makowski:
Tail probabilities for M/G/Y input processes (I): Preliminary asymptotics. Queueing Syst. Theory Appl. 27(3-4): 271-296 (1997) - 1995
- [j7]Ramin Rezaiifar, Armand M. Makowski, Srikanta P. Kumar:
Stochastic Control of Handoffs in Cellular Networks. IEEE J. Sel. Areas Commun. 13(7): 1348-1362 (1995) - 1994
- [j6]Subir Varma, Armand M. Makowski:
Interpolation Approximations for Symmetric Fork-Join Queues. Perform. Evaluation 20(1-3): 245-265 (1994) - [j5]Dye-Jyun Ma, Armand M. Makowski:
On the convergence and ODE limit of a two-dimensional stochastic approximation. IEEE Trans. Autom. Control. 39(7): 1439-1442 (1994) - 1993
- [j4]Armand M. Makowski, Adam Shwartz:
On constrained optimization of the Klimov network and related Markov decision processes. IEEE Trans. Autom. Control. 38(2): 354-359 (1993) - 1990
- [j3]Adam Shwartz, Armand M. Makowski:
Comparing Policies in Markov Decision Processes: Mandl's Lemma Revisited. Math. Oper. Res. 15(1): 155-174 (1990) - 1989
- [j2]François Baccelli, Armand M. Makowski:
Multidimensional Stochastic Ordering and Associated Random Variables. Oper. Res. 37(3): 478-487 (1989) - [j1]François Baccelli, Armand M. Makowski:
Queueing models for systems with synchronization constraints. Proc. IEEE 77(1): 138-161 (1989)
Conference and Workshop Papers
- 2015
- [c32]Armand M. Makowski, Osman Yagan:
On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes. Allerton 2015: 1494-1501 - [c31]Siddharth Pal, Armand M. Makowski:
On the asymptotics of degree distributions. CDC 2015: 5506-5511 - 2013
- [c30]Armand M. Makowski, Osman Yagan:
Random threshold graphs with exponential fitness: The width of the phase transition for connectivity. ISIT 2013: 61-65 - 2012
- [c29]Osman Yagan, Armand M. Makowski:
Connectivity results for sensor networks under a random pairwise key predistribution scheme. ISIT 2012: 1797-1801 - 2011
- [c28]Osman Yagan, Armand M. Makowski:
Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links. ICC 2011: 1-5 - [c27]Osman Yagan, Armand M. Makowski:
On the resiliency of sensor networks under the pairwise key distribution scheme. PIMRC 2011: 1218-1222 - [c26]Osman Yagan, Armand M. Makowski:
On the gradual deployment of random pairwise key distribution schemes. WiOpt 2011: 257-264 - 2010
- [c25]Osman Yagan, Armand M. Makowski:
Connectivity in random graphs induced by a key predistribution scheme - small key pools. CISS 2010: 1-6 - [c24]N. Prasanth Anthapadmanabhan, Armand M. Makowski:
On the Absence of Isolated Nodes in Wireless Ad-Hoc Networks with Unreliable Links - a Curious Gap. INFOCOM 2010: 2561-2569 - 2009
- [c23]Osman Yagan, Armand M. Makowski:
On the existence of triangles in random key graphs. Allerton 2009: 1567-1574 - [c22]Osman Yagan, Armand M. Makowski:
Connectivity results for random key graphs. ISIT 2009: 2403-2407 - [c21]Osman Yagan, Armand M. Makowski:
Random Key Graphs. NetCoM 2009: 313-318 - 2008
- [c20]Armand M. Makowski:
The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm. ANTS Conference 2008: 167-178 - [c19]Osman Yagan, Armand M. Makowski:
On the random graph induced by a random key predistribution scheme under full visibility. ISIT 2008: 544-548 - 2007
- [c18]Guang Han, Armand M. Makowski:
On the critical communication range under node placement with vanishing densities. ISIT 2007: 831-835 - 2006
- [c17]Guang Han, Armand M. Makowski:
Very sharp transitions in one-dimensional MANETs. ICC 2006: 217-222 - [c16]Yijie Han, Armand M. Makowski:
Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. INFOCOM 2006 - [c15]Sarut Vanichpun, Armand M. Makowski:
Modeling Locality of Reference via Notions of Positive Dependence - Some Mixed News. INFOCOM 2006 - 2004
- [c14]Konstantinos P. Tsoukatos, Armand M. Makowski:
Stochastic comparisons for a static routing problem with resequencing. ICC 2004: 2127-2131 - [c13]Armand M. Makowski:
Bounding superposed on-off sources - variability ordering and majorization to the rescue. ICC 2004: 2158-2162 - [c12]Sarut Vanichpun, Armand M. Makowski:
Comparing strength of locality of reference -- Popularity, majorization, and some folk theorems. INFOCOM 2004: 838-849 - [c11]Sarut Vanichpun, Armand M. Makowski:
The output of a cache under the independent reference model: where did the locality of reference go? SIGMETRICS 2004: 295-306 - 2003
- [c10]Omri Bahat, Armand M. Makowski:
Optimal replacement policies for non-uniform cache objects with optional eviction. INFOCOM 2003: 427-437 - [c9]Peerapol Tinnakornsrisuphap, Armand M. Makowski:
Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows. INFOCOM 2003: 873-883 - 2002
- [c8]Sarut Vanichpun, Armand M. Makowski:
Positive correlations and buffer occupancy: Lower bound via supermodular ordering. INFOCOM 2002: 1298-1306 - [c7]Armand M. Makowski, Peerapol Tinnakornsrisuphap:
Many flow asymptotics for TCP with ECN/RED. ITW 2002: 29-32 - 2001
- [c6]Peerapol Tinnakornsrisuphap, Armand M. Makowski:
Queue dynamics of RED gateways under large number of TCP flows. GLOBECOM 2001: 1847-1851 - 1999
- [c5]Konstantinos P. Tsoukatos, Armand M. Makowski:
Interpolation approximations for M/G/ ∞ arrival processes. ICC 1999: 392-396 - 1998
- [c4]Marwan Krunz, Armand M. Makowski:
A Source Model for VBR Video Traffic Based on M/G/infinity Input Processes. INFOCOM 1998: 1441-1448 - 1997
- [c3]Minothi Parulekar, Armand M. Makowski:
M/G/infinity Input Processes: A Versatile Class of Models for Network Traffic. INFOCOM 1997: 419-426 - 1996
- [c2]Minothi Parulekar, Armand M. Makowski:
Trail Probabilities for a Multiplexer with Self-Similar Traffic. INFOCOM 1996: 1452-1459 - 1987
- [c1]Levent Gün, Armand M. Makowski:
Matrix-Geometric Solution for Finite Capacity Queues with Phase-Type Distributions. Performance 1987: 269-282
Informal and Other Publications
- 2019
- [i9]Sikai Qu, Armand M. Makowski:
Node isolation in large homogeneous binary multiplicative attribute graph models. CoRR abs/1901.09698 (2019) - [i8]Armand M. Makowski, Siddharth Pal:
Asymptotic degree distributions in random threshold graphs. CoRR abs/1908.07066 (2019) - 2018
- [i7]Sikai Qu, Armand M. Makowski:
On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models. CoRR abs/1810.10114 (2018) - 2017
- [i6]Osman Yagan, Armand M. Makowski:
Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version). CoRR abs/1701.03758 (2017) - [i5]Ane Izagirre, Armand M. Makowski:
Light traffic behavior under the power-of-two load balancing strategy: The case of heterogeneous servers. CoRR abs/1701.06004 (2017) - [i4]Siddharth Pal, Armand M. Makowski:
Asymptotic degree distributions in large homogeneous random networks: A little theory and a counterexample. CoRR abs/1710.11064 (2017) - 2011
- [i3]Osman Yagan, Armand M. Makowski:
Modeling the pairwise key distribution scheme in the presence of unreliable links. CoRR abs/1102.2250 (2011) - [i2]Osman Yagan, Armand M. Makowski:
On the gradual deployment of random pairwise key distribution schemes (Extended Version). CoRR abs/1103.4401 (2011) - 2008
- [i1]N. Prasanth Anthapadmanabhan, Armand M. Makowski:
Intersecting random graphs and networks with multiple adjacency constraints: A simple example. CoRR abs/0809.0918 (2008)
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-24 22:47 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:
