Brian H. Marcus

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Erez Louidor

> Home > Persons > Brian H. Marcus

Publications

2010
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/LouidorM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/LouidorM10
Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients. IEEE Trans. Inf. Theory 56(4): 1624-1639 (2010)
2009
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/LouidorM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/LouidorM09
Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients. ISIT 2009: 1045-1049
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0903-1716
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0903-1716
Erez Louidor, Brian H. Marcus:
Improved Lower Bounds on Capacities of Symmetric 2-Dimensional Constraints using Rayleigh Quotients. CoRR abs/0903.1716 (2009)
2008
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/LouidorPCM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/LouidorPCM08
Erez Louidor, Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
Maximum insertion rate and capacity of multidimensional constraints. ISIT 2008: 1458-1462

a service of

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.