default search action
Boris D. Lubachevsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [i6]Boris D. Lubachevsky:
Why The Results of Parallel and Serial Monte Carlo Simulations May Differ. CoRR abs/1104.0198 (2011)
2000 – 2009
- 2009
- [j20]Boris D. Lubachevsky, Ronald L. Graham:
Minimum perimeter rectangles that enclose congruent non-overlapping circles. Discret. Math. 309(8): 1947-1962 (2009) - 2006
- [i5]Boris D. Lubachevsky:
Theory of sexes by Geodakian as it is advanced by Iskrin. CoRR abs/cs/0607007 (2006) - 2005
- [i4]Boris D. Lubachevsky:
How to Simulate Billiards and Similar Systems. CoRR abs/cond-mat/0503627 (2005) - [i3]Boris D. Lubachevsky:
Efficient Parallel Simulations of Asynchronous Cellular Arrays. CoRR abs/cs/0502039 (2005) - 2004
- [i2]Boris D. Lubachevsky, Alan Weiss:
Synchronous Relaxation for Parallel Ising Spin Simulations. CoRR cs.DC/0405053 (2004) - [i1]Boris D. Lubachevsky:
Fast Simulation of Multicomponent Dynamic Systems. CoRR cs.DS/0405077 (2004) - 2001
- [c19]Boris D. Lubachevsky, Alan Weiss:
Synchronous relaxation for parallel Ising spin simulations. Workshop on Parallel and Distributed Simulation 2001: 185-192 - 2000
- [j19]Boris D. Lubachevsky:
Fast simulation of multicomponent dynamic systems. Bell Labs Tech. J. 5(2): 134-156 (2000) - [j18]David W. Boll, Jerry Donovan, Ronald L. Graham, Boris D. Lubachevsky:
Improving Dense Packings of Equal Disks in a Square. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1998
- [j17]Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård:
Dense packings of congruent circles in a circle. Discret. Math. 181(1-3): 139-154 (1998) - [c18]Sem C. Borst, Sudheer A. Grandhi, Colin L. Kahn, Krishnan Kumaran, Boris D. Lubachevsky, Donna M. Sand:
Simulation of Self-Organizing Spectrum Management in Wireless Networks. MASCOTS 1998: 268-273 - 1997
- [j16]Simon C. Borst, Sudheer A. Grandhi, Colin L. Kahn, Krishnan Kumaran, Boris D. Lubachevsky, Donna M. Sand:
Wireless simulation and self-organizing spectrum management. Bell Labs Tech. J. 2(3): 81-98 (1997) - [j15]Boris D. Lubachevsky, Ronald L. Graham:
Curved Hexagonal Packings of Equal Disks in a Circle. Discret. Comput. Geom. 18(2): 179-194 (1997) - 1996
- [j14]Ronald L. Graham, Boris D. Lubachevsky:
Repeated Patterns of Dense Packings of Equal Disks in a Square. Electron. J. Comb. 3(1) (1996) - [j13]Albert G. Greenberg, Boris D. Lubachevsky, Isi Mitrani:
Superfast Parallel Discrete Event Simulations. ACM Trans. Model. Comput. Simul. 6(2): 107-136 (1996) - [c17]Krishnan Kumaran, Boris D. Lubachevsky, Anwar Elwalid:
Massively Parallel Simulations of ATM Systems. Workshop on Parallel and Distributed Simulation 1996: 39-46 - 1995
- [j12]Ronald L. Graham, Boris D. Lubachevsky:
Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond. Electron. J. Comb. 2 (1995) - [c16]Boris D. Lubachevsky, Ronald L. Graham:
Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5. COCOON 1995: 303-312 - [c15]Albert G. Greenberg, Boris D. Lubachevsky, David M. Nicol, Paul E. Wright:
Efficient Massively Parallel Simulation of Dynamic Channel Assignment Schemes for Wireless Cellular Communications. MASCOTS 1995: 45-47 - [c14]Boris D. Lubachevsky, Vladimir Privman, Subhas C. Roy:
The ultimate bead counter: efficient massively parallel simulation of ballistic deposition. PADS 1995: 95-102 - 1994
- [j11]David M. Nicol, Albert G. Greenberg, Boris D. Lubachevsky:
Massively Parallel Algorithms for Trace-Driven Cache Simulations. IEEE Trans. Parallel Distributed Syst. 5(8): 849-859 (1994) - [c13]Albert G. Greenberg, Boris D. Lubachevsky, David M. Nicol, Paul E. Wright:
Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications. PADS 1994: 187-197 - 1993
- [j10]Stephen G. Eick, Albert G. Greenberg, Boris D. Lubachevsky, Alan Weiss:
Synchronous Relaxation for Parallel Simulations with Applications to Circuit-Switched Networks. ACM Trans. Model. Comput. Simul. 3(4): 287-314 (1993) - [c12]Boris D. Lubachevsky:
Several unsolved problems in large-scale discrete event simulations. PADS 1993: 60-67 - [c11]Boris D. Lubachevsky:
Relaxation for Massively Parallel Discrete Event Simulation. Performance/SIGMETRICS Tutorials 1993: 307-329 - [c10]Albert G. Greenberg, Boris D. Lubachevsky, Li-C. Wang:
Experience in Massively Parallel Discrete Event Simulation. SPAA 1993: 193-202 - 1992
- [c9]David M. Nicol, Albert G. Greenberg, Boris D. Lubachevsky:
MIMD Parallel Simulation of Circuit-Switched Communication Networks. WSC 1992: 629-636 - 1991
- [j9]Albert G. Greenberg, Boris D. Lubachevsky, Isi Mitrani:
Algorithms for Unboundedly Parallel Simulations. ACM Trans. Comput. Syst. 9(3): 201-221 (1991) - [j8]Boris D. Lubachevsky, Alan Weiss, Adam Shwartz:
An Analysis of Rollback-Based Simulation. ACM Trans. Model. Comput. Simul. 1(2): 154-193 (1991) - 1990
- [j7]Boris D. Lubachevsky:
Synchronization barrier and related tools for shared memory parallel programming. Int. J. Parallel Program. 19(3): 225-250 (1990) - [c8]Albert G. Greenberg, Boris D. Lubachevsky, Isi Mitrani:
Unboundedly Parallel Simulations Via Recurrence Relations. SIGMETRICS 1990: 1-12 - [c7]Albert G. Greenberg, Boris D. Lubachevsky, Isi Mitrani:
Unboundedly parallel simulations via recurrence relations for network and reliability problems. WSC 1990: 731-733
1980 – 1989
- 1989
- [j6]Boris D. Lubachevsky:
Efficient Distributed Event-Driven Simulations of Multiple-Loop Networks. Commun. ACM 32(1): 111-123 (1989) - [c6]Boris D. Lubachevsky:
Synchronization Barrier and Related Tools for Shared Memory Parallel Programming. ICPP (2) 1989: 175-179 - [c5]Boris D. Lubachevsky, Adam Shwartz, Alan Weiss:
Rollback sometimes works...if filtered. WSC 1989: 630-639 - 1988
- [j5]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko:
Simple, Efficient Asynchronous Parallel Algorithms for Maximization. ACM Trans. Program. Lang. Syst. 10(2): 313-337 (1988) - [c4]Boris D. Lubachevsky:
Efficient Distributed Event-Driven Simulations of Multiple-Loop Networks. SIGMETRICS 1988: 12-21 - 1987
- [j4]Boris D. Lubachevsky:
Efficient Parallel Simulations of Asynchronous Cellular Arrays. Complex Syst. 1(6) (1987) - [c3]Albert G. Greenberg, Boris D. Lubachevsky:
Simple, Efficient Asynchronous Parallel Prefix Algorithms. ICPP 1987: 66-69 - 1986
- [j3]Boris D. Lubachevsky, Debasis Mitra:
A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius. J. ACM 33(1): 130-150 (1986) - 1985
- [c2]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko:
Simple, Efficient Asynchronous Parallel Algorithms for Maximization. PODC 1985: 300-308 - 1984
- [j2]Boris D. Lubachevsky:
An Approach to Automating the Verification of Compact Parallel Coordination Programs I. Acta Informatica 21: 125-169 (1984) - 1983
- [j1]Allan Gottlieb
, Boris D. Lubachevsky, Larry Rudolph:
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors. ACM Trans. Program. Lang. Syst. 5(2): 164-189 (1983) - [c1]Boris D. Lubachevsky:
A Verifier for Compact Parallel Coordination Programs. Logic of Programs 1983: 326-340
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:53 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: