A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups

Gyan Bhanot; Christian B. Lang; Claudio Rebbi

doi:10.1016/0010-4655(82)90023-6

A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups

Gyan Bhanot, Christian B. Lang, Claudio Rebbi

Research output: Contribution to journal › Article › peer-review

Original language	English (US)
Pages (from-to)	275-287
Number of pages	13
Journal	Computer Physics Communications
Volume	25
Issue number	3
DOIs	https://doi.org/10.1016/0010-4655(82)90023-6
State	Published - Mar 1982
Externally published	Yes

All Science Journal Classification (ASJC) codes

Hardware and Architecture
Physics and Astronomy(all)

Access to Document

10.1016/0010-4655(82)90023-6

Cite this

@article{226ceed0a9f7402ebdf22a4ddf1b897e,

title = "A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups",

author = "Gyan Bhanot and Lang, {Christian B.} and Claudio Rebbi",

year = "1982",

month = mar,

doi = "10.1016/0010-4655(82)90023-6",

language = "English (US)",

volume = "25",

pages = "275--287",

journal = "Computer Physics Communications",

issn = "0010-4655",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups

AU - Bhanot, Gyan

AU - Lang, Christian B.

AU - Rebbi, Claudio

PY - 1982/3

Y1 - 1982/3

UR - http://www.scopus.com/inward/record.url?scp=49049138536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049138536&partnerID=8YFLogxK

U2 - 10.1016/0010-4655(82)90023-6

DO - 10.1016/0010-4655(82)90023-6

M3 - Article

AN - SCOPUS:49049138536

SN - 0010-4655

VL - 25

SP - 275

EP - 287

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 3

ER -

A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this