Matrix-Geometric Solution for Finite Capacity Queues with Phase-Type Distributions. - Levent Gün; Armand M. Makowski (Performance, 1987)

Multidimensional Stochastic Ordering and Associated Random Variables. - François Baccelli; Armand M. Makowski (Oper. Res., 1989)

Queueing models for systems with synchronization constraints. - François Baccelli; Armand M. Makowski (Proc. IEEE, 1989)

Comparing Policies in Markov Decision Processes: Mandl's Lemma Revisited. - Adam Shwartz; Armand M. Makowski (Math. Oper. Res., 1990)

On constrained optimization of the Klimov network and related Markov decision processes. - Armand M. Makowski; Adam Shwartz (IEEE Trans. Autom. Control., 1993)

Interpolation Approximations for Symmetric Fork-Join Queues. - Subir Varma; Armand M. Makowski (Perform. Evaluation, 1994)

On the convergence and ODE limit of a two-dimensional stochastic approximation. - Dye-Jyun Ma; Armand M. Makowski (IEEE Trans. Autom. Control., 1994)

Stochastic Control of Handoffs in Cellular Networks. - Ramin Rezaiifar; Armand M. Makowski; Srikanta P. Kumar (IEEE J. Sel. Areas Commun., 1995)

Trail Probabilities for a Multiplexer with Self-Similar Traffic. - Minothi Parulekar; Armand M. Makowski (INFOCOM, 1996)

M/G/infinity Input Processes: A Versatile Class of Models for Network Traffic. - Minothi Parulekar; Armand M. Makowski (INFOCOM, 1997)

From Optimal Search Theory to Sequential Paging in Cellular Networks. - Ramin Rezaiifar; Armand M. Makowski (IEEE J. Sel. Areas Commun., 1997)

Tail probabilities for M/G/Y input processes (I): Preliminary asymptotics. - Minothi Parulekar; Armand M. Makowski (Queueing Syst. Theory Appl., 1997)

A Source Model for VBR Video Traffic Based on M/G/infinity Input Processes. - Marwan Krunz; Armand M. Makowski (INFOCOM, 1998)

Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models. - Marwan Krunz; Armand M. Makowski (IEEE J. Sel. Areas Commun., 1998)

Simple optimization problems via majorization ordering. - Young B. Kim; Armand M. Makowski (IEEE Trans. Autom. Control., 1998)

Interpolation approximations for M/G/ ∞ arrival processes. - Konstantinos P. Tsoukatos; Armand M. Makowski (ICC, 1999)

On a Reduced Load Equivalence for Fluid Queues Under Subexponentiality. - Rajeev Agrawal; Armand M. Makowski; Philippe Nain (Queueing Syst. Theory Appl., 1999)

Steering policies for controlled Markov chains under a recurrence condition. - Dye-Jyun Ma; Armand M. Makowski (IEEE Trans. Autom. Control., 1999)

Heavy traffic limits associated with input processes. - Konstantinos P. Tsoukatos; Armand M. Makowski (Queueing Syst. Theory Appl., 2000)

Queue dynamics of RED gateways under large number of TCP flows. - Peerapol Tinnakornsrisuphap; Armand M. Makowski (GLOBECOM, 2001)

Convex stability and asymptotic convex ordering for non-stationary arrival processes. - Lei Kuang; Armand M. Makowski (SIGMETRICS Perform. Evaluation Rev., 2001)

Positive correlations and buffer occupancy: Lower bound via supermodular ordering. - Sarut Vanichpun; Armand M. Makowski (INFOCOM, 2002)

Many flow asymptotics for TCP with ECN/RED. - Armand M. Makowski; Peerapol Tinnakornsrisuphap (ITW, 2002)

Long-range dependence does not necessarily imply non-exponential tails. - Armand M. Makowski (IEEE Commun. Lett., 2002)

Optimal replacement policies for non-uniform cache objects with optional eviction. - Omri Bahat; Armand M. Makowski (INFOCOM, 2003)

Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows. - Peerapol Tinnakornsrisuphap; Armand M. Makowski (INFOCOM, 2003)

Bounding superposed on-off sources - variability ordering and majorization to the rescue. - Armand M. Makowski (ICC, 2004)

Stochastic comparisons for a static routing problem with resequencing. - Konstantinos P. Tsoukatos; Armand M. Makowski (ICC, 2004)

Comparing strength of locality of reference – Popularity, majorization, and some folk theorems. - Sarut Vanichpun; Armand M. Makowski (INFOCOM, 2004)

The output of a cache under the independent reference model: where did the locality of reference go? - Sarut Vanichpun; Armand M. Makowski (SIGMETRICS, 2004)

Measuring consistency in TTL-based caches. - Omri Bahat; Armand M. Makowski (Perform. Evaluation, 2005)

Very sharp transitions in one-dimensional MANETs. - Guang Han 001; Armand M. Makowski (ICC, 2006)

Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. - Yijie Han; Armand M. Makowski (INFOCOM, 2006)

Modeling Locality of Reference via Notions of Positive Dependence - Some Mixed News. - Sarut Vanichpun; Armand M. Makowski (INFOCOM, 2006)

Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue. - Yijie Han; Richard J. La; Armand M. Makowski; Seungjoon Lee (Comput. Networks, 2006)

On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems. - Peerapol Tinnakornsrisuphap; Armand M. Makowski (Queueing Syst. Theory Appl., 2006)

Asymptotic optimality of the Round-Robin policy in multipath routing with resequencing. - Konstantinos P. Tsoukatos; Armand M. Makowski (Queueing Syst. Theory Appl., 2006)

On the Optimality of Uniform Pulse Amplitude Modulation. - Armand M. Makowski (IEEE Trans. Inf. Theory, 2006)

On the critical communication range under node placement with vanishing densities. - Guang Han 001; Armand M. Makowski (ISIT, 2007)

A very strong zero-one law for connectivity in one-dimensional geometric random graphs. - Guang Han 001; Armand M. Makowski (IEEE Commun. Lett., 2007)

The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm. - Armand M. Makowski (ANTS Conference, 2008)

On the random graph induced by a random key predistribution scheme under full visibility. - Osman Yagan; Armand M. Makowski (ISIT, 2008)

Intersecting random graphs and networks with multiple adjacency constraints: A simple example - N. Prasanth Anthapadmanabhan; Armand M. Makowski (CoRR, 2008)

Power-law vs exponential queueing in a network traffic model. - Konstantinos P. Tsoukatos; Armand M. Makowski (Perform. Evaluation, 2008)

On the existence of triangles in random key graphs. - Osman Yagan; Armand M. Makowski (Allerton, 2009)

Connectivity results for random key graphs. - Osman Yagan; Armand M. Makowski (ISIT, 2009)

Random Key Graphs. - Osman Yagan; Armand M. Makowski (NetCoM, 2009)

Sensitivity of Critical Transmission Ranges to Node Placement Distributions. - Guang Han 001; Armand M. Makowski (IEEE J. Sel. Areas Commun., 2009)

One-dimensional geometric random graphs with nonvanishing densities: part I: a strong zero-one law for connectivity. - Guang Han 001; Armand M. Makowski (IEEE Trans. Inf. Theory, 2009)

Connectivity in random graphs induced by a key predistribution scheme - small key pools. - Osman Yagan; Armand M. Makowski (CISS, 2010)

On the Absence of Isolated Nodes in Wireless Ad-Hoc Networks with Unreliable Links - a Curious Gap. - N. Prasanth Anthapadmanabhan; Armand M. Makowski (INFOCOM, 2010)

Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links. - Osman Yagan; Armand M. Makowski (ICC, 2011)

On the resiliency of sensor networks under the pairwise key distribution scheme. - Osman Yagan; Armand M. Makowski (PIMRC, 2011)

On the gradual deployment of random pairwise key distribution schemes. - Osman Yagan; Armand M. Makowski (WiOpt, 2011)

Modeling the pairwise key distribution scheme in the presence of unreliable links - Osman Yagan; Armand M. Makowski (CoRR, 2011)

On the gradual deployment of random pairwise key distribution schemes (Extended Version) - Osman Yagan; Armand M. Makowski (CoRR, 2011)

Connectivity results for sensor networks under a random pairwise key predistribution scheme. - Osman Yagan; Armand M. Makowski (ISIT, 2012)

One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity. - Guang Han 001; Armand M. Makowski (Queueing Syst. Theory Appl., 2012)

Zero-One Laws for Connectivity in Random Key Graphs. - Osman Yagan; Armand M. Makowski (IEEE Trans. Inf. Theory, 2012)

Random threshold graphs with exponential fitness: The width of the phase transition for connectivity. - Armand M. Makowski; Osman Yagan (ISIT, 2013)

On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension. - Armand M. Makowski; Guang Han 001 (Found. Trends Netw., 2013)

Scaling Laws for Connectivity in Random Threshold Graph Models with Non-Negative Fitness Variables. - Armand M. Makowski; Osman Yagan (IEEE J. Sel. Areas Commun., 2013)

On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes. - Osman Yagan; Armand M. Makowski (Perform. Evaluation, 2013)

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links. - Osman Yagan; Armand M. Makowski (IEEE Trans. Inf. Theory, 2013)

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution. - Osman Yagan; Armand M. Makowski (IEEE Trans. Inf. Theory, 2013)

Light traffic performance under the power of two load balancing strategy: the case of server heterogeneity. - Ane Izagirre; Armand M. Makowski (SIGMETRICS Perform. Evaluation Rev., 2014)

On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes. - Armand M. Makowski; Osman Yagan (Allerton, 2015)

On the asymptotics of degree distributions. - Siddharth Pal; Armand M. Makowski (CDC, 2015)

Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings? - Osman Yagan; Armand M. Makowski (IEEE/ACM Trans. Netw., 2016)

Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version). - Osman Yagan; Armand M. Makowski (CoRR, 2017)

Light traffic behavior under the power-of-two load balancing strategy: The case of heterogeneous servers. - Ane Izagirre; Armand M. Makowski (Perform. Evaluation, 2017)

On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models. - Sikai Qu; Armand M. Makowski (CoRR, 2018)

Node isolation in large homogeneous binary multiplicative attribute graph models. - Sikai Qu; Armand M. Makowski (CoRR, 2019)

Asymptotic degree distributions in random threshold graphs. - Armand M. Makowski; Siddharth Pal (CoRR, 2019)

Asymptotic Degree Distributions in Large (Homogeneous) Random Networks: A Little Theory and a Counterexample. - Siddharth Pal; Armand M. Makowski (IEEE Trans. Netw. Sci. Eng., 2020)