Movatterモバイル変換


[0]ホーム

URL:


Schloss Dagstuhl - Leibniz Center for Informatics
For some weeks now, the dblp team has been receiving anexceptionally high number of support and error correction requests from the community. While we are grateful and happy to process all incoming emails, please assume thatit will currently take us several weeks to read and address your request. Most importantly,please refrain from sending your request multiple times. This will not advance your issue and will only complicate and extend the time required to address it. Thank you for your understanding.
Joint Declaration:The freedom of science is at the heart of liberal, democratic societies. Without this freedom, it is impossible for scientific efforts to be geared toward gaining knowledge and facts. It is therefore extremely worrying that the scientific freedom is coming under increasing pressure in various regions of the world.(read more)
We've just launched a new service: our brand newdblp SPARQL query service. Read more about it inour latest blog post or try out some of the SPARQL queries linked on the dblp web pages below.
search dblp
search dblp

default search action

Authors:
  • no matches
  • waiting...
Venues:
  • no matches
  • waiting...
Publications:
  • no matches
  • waiting...
clear
ask others

ask others

ISIT 2015: Hong Kong, China

SPARQL queries 

run query for this table of contents

or build your own?

Refine list

note

refinements active!

zoomed in on?? of?? records

    view refined list in

    export refined list as

    showing all?? records

    Mo-AM1-1:List Decoding 1

    Mo-AM1-2:Cooperative MACS

    Mo-AM1-3:LPDC and Spatially Coupled LDPC Codes

    Mo-AM1-4:Topics in Coding and Information Theory

    Mo-AM1-5:Error Exponents 1

    Mo-AM1-6:Gaussian Channels and Secrecy

    Mo-AM1-7:Capacity in Energy Harvesting Communications

    Mo-AM1-8:Changepoint Detection and Estimation

    Mo-AM1-9:Ad Hoc and Wireless Networks

    Mo-AM2-1:Algebra for Coding

    Mo-AM2-2:Gaussian Interference Channels

    Mo-AM2-3:Finite Length Analysis of Polar Codes

    Mo-AM2-4:application Specific Codes

    Mo-AM2-5:Source-Channel Coding 1

    Mo-AM2-6:Capacity and Equivocation Aspects of Secrecy

    Mo-AM2-7:Finite Blocklength Analysis 1

    Mo-AM2-8:Advances in Signal Processing

    Mo-AM2-9:Fading Channels 1

    Mo-PM1-1:Network Coding for Multiple Unicasts

    Mo-PM1-2:Broadcast Channels

    Mo-PM1-3:LDPC Code Analysis

    Mo-PM1-4:Lattice Codes 1

    Mo-PM1-5:Source-Channel Coding 2

    Mo-PM1-6:Boolean Functions and Cryptography

    Mo-PM1-7:Topics in Shannon Theory 1

    Mo-PM1-8:Algorithms for Compressed Sensing

    Mo-PM1-9:Physical-Layer Network Coding

    Mo-PM2-1:Topics in Network Coding 1

    Mo-PM2-2:The X-Channel

    Mo-PM2-3:Coding for Memory

    Mo-PM2-4:Big Data Analytics

    Mo-PM2-5:Distributed Quantum Protocols

    Mo-PM2-6:Key Generation and Distribution

    Mo-PM2-7:Information Measures

    Mo-PM2-8:Topics in Detection and Estimation 1

    Mo-PM2-9:Queueing

    Tu-AM1-SP1:Semi-Plenary Session 1A

    Tu-AM1-SP2:Semi-Plenary Session 1B

    Tu-AM2-1:Regenerating Codes 1

    Tu-AM2-2:Interference Alignment 1

    Tu-AM2-3:Spatially-Coupled Codes

    Tu-AM2-4:Sequence Assembly and DNA Storage

    Tu-AM2-5:Error Exponents 2

    Tu-AM2-6:Information Theoretic Security

    Tu-AM2-7:Topics in Shannon Theory 2

    Tu-AM2-8:Applications of Compressed Sensing 1

    Tu-AM2-9:Cellular Networks

    Tu-PM1-1:Index Coding

    Tu-PM1-2:Degrees of Freedom in Networks

    Tu-PM1-3:Design of LDPC Codes

    Tu-PM1-4:Quantum Codes

    Tu-PM1-5:Energy Harvesting Communications

    Tu-PM1-6:Wiretap Channel 1

    Tu-PM1-7:Information Theory and Statistics

    Tu-PM1-8:Pattern Recognition and Learning

    Tu-PM1-9:Massive MIMO 1

    Tu-PM2-1:Locally Repairable Codes 1

    Tu-PM2-2:Relay Networks 1

    Tu-PM2-3:On Polarization and Polar Code Construction

    Tu-PM2-4:Coding for Memory and Distributed Storage

    Tu-PM2-5:Information Theory for Biology 1

    Tu-PM2-6:Secrecy in Broadcast Channels 1

    Tu-PM2-7:Estimation of Distributions and Their Functionals

    Tu-PM2-8:Streaming and Zero-Delay Source Coding

    Tu-PM2-9:Scheduling in Wireless Networks

    We-AM1-SP1:Semi-Plenary Session 2A

    We-AM1-SP2:Semi-Plenary Session 2B

    We-AM2-1:Distributed Storage

    We-AM2-2:Interference Alignment 2

    We-AM2-3:Applications of Polar Codes

    We-AM2-4:Construction of Sequences

    We-AM2-5:Multi-Terminal Source Coding 1

    We-AM2-6:Security in Various Settings

    We-AM2-7:Information Measures and Statistics

    We-AM2-8:Compressed Sensing and Sparsity

    We-AM2-9:Optical Communication and Networking

    Th-AM1-1:Coded Caching

    Th-AM1-2:Treating Interference as Noise

    Th-AM1-3:Coding for Flash Memory 1

    Th-AM1-4:Analysis of Coding Systems

    Th-AM1-5:Multi-Terminal Source Coding 2

    Th-AM1-6:Privacy

    Th-AM1-7:Finite Blocklength Analysis 2

    Th-AM1-8:Matrix Completion

    Th-AM1-9:Cognitive Communication and Sensor Networks

    Th-AM2-1:Locally Repairable Codes 2

    Th-AM2-2:Multiway Relay Channels

    Th-AM2-3:LDPC Code Encoding and Analysis

    Th-AM2-4:Combinatorial Coding Theory

    Th-AM2-5:Information Theory for Biology 2

    Th-AM2-6:Secrecy in Broadcast Channels 2

    Th-AM2-7:Universal Source Coding

    Th-AM2-8:Topics in Compressed Sensing

    Th-AM2-9:Cooperative Communication

    Th-PM1-1:Regenerating Codes 2

    Th-PM1-2:Structured Codes

    Th-PM1-3:Coding for Flash Memory 2

    Th-PM1-4:Applications of Coding Theory

    Th-PM1-5:Topics in Network Information Theory

    Th-PM1-6:Fading and Arbitrarily Varying Wiretap Channel

    Th-PM1-7:Lossy Source Coding

    Th-PM1-8:Dictionary Learning and Subspace Classification

    Th-PM1-9:Topics in Game Theory & Control

    Th-PM2-1:List Decoding 2

    Th-PM2-2:Gaussian Relay Networks

    Th-PM2-3:On the Ising Model

    Th-PM2-4:Streaming

    Th-PM2-5:Estimation of Distributions and Dirty Paper Coding

    Th-PM2-6:Wiretap Channel 2

    Th-PM2-7:Capacity Bounds

    Th-PM2-8:Information-Theoretic Approaches to Compressed Sensing

    Th-PM2-9:Fading Channels 2

    Fr-AM1-SP1:Semi-Plenary Session 3A

    Fr-AM1-SP2:Semi-Plenary Session 3b

    Fr-AM2-1:Algebraic Codes

    Fr-AM2-2:Interference Channels and Networks

    Fr-AM2-3:Polarization Theory

    Fr-AM2-4:Lattice Codes 2

    Fr-AM2-5:Feedback

    Fr-AM2-6:Security and Channels

    Fr-AM2-7:Topics in Shannon Theory 3

    Fr-AM2-8:Applications of Compressed Sensing 2

    Fr-AM2-9:Massive MIMO 2

    Fr-PM1-1:Topics in Network Coding 2

    Fr-PM1-2:Broadcast and Multiple Access

    Fr-PM1-3:Decoding of LDPC Codes

    Fr-PM1-4:Sequences

    Fr-PM1-5:Energy Harvesting in Fading and Multiuser Channels

    Fr-PM1-6:Cryptography and Secure Computing

    Fr-PM1-7:Quantum Shannon Theory

    Fr-PM1-8:Message Passing and Hypothesis Testing

    Fr-PM1-9:Topics in Wireless Networks

    Fr-PM2-1:Topics in Distributed Storage

    Fr-PM2-2:Relay Networks 2

    Fr-PM2-3:Weight Distribution and Minimum Distance of LDPC Codes

    Fr-PM2-4:Topics in Coding Theory

    Fr-PM2-5:Topics in Detection and Estimation 2

    Fr-PM2-6:Security and Correlation

    Fr-PM2-7:Finite Blocklength Analysis 3

    Fr-PM2-8:Data Compression

    Fr-PM2-9:Topics in Wireless Communiction

    manage site settings

    To protect your privacy, all features that rely on external API calls from your browser areturned 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 informationsee our F.A.Q.

    Unpaywalled article links

    Add open access links fromunpaywall.org to the list of external document links (if available).

    load links from unpaywall.org

    Privacy notice: By enabling the option above, your browser will contact the API ofunpaywall.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 theUnpaywall privacy policy.

    Archived links via Wayback Machine

    For web page which are no longer available, try to retrieve content from theweb.archive.org of the Internet Archive (if available).

    load content from archive.org

    Privacy notice: By enabling the option above, your browser will contact the API ofarchive.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 theInternet Archive privacy policy.

    Reference lists

    Add a list of references fromcrossref.org,opencitations.net, andsemanticscholar.org 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 ofcrossref.org,opencitations.net, andsemanticscholar.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 theCrossref privacy policy and theOpenCitations privacy policy, as well as theAI2 Privacy Policy covering Semantic Scholar.

    Citation data

    Add a list of citing articles fromopencitations.net andsemanticscholar.org to record detail pages.

    load citations from opencitations.net

    Privacy notice: By enabling the option above, your browser will contact the API ofopencitations.net andsemanticscholar.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 theOpenCitations privacy policy as well as theAI2 Privacy Policy covering Semantic Scholar.

    OpenAlex data

    Load additional information about publications fromopenalex.org.

    load data from openalex.org

    Privacy notice: By enabling the option above, your browser will contact the API ofopenalex.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 byOpenAlex.

    w3c valid html last updated on 2025-05-23 00:22 CEST by thedblp team

    cc zero all metadata released asopen data underCC0 1.0 license

    see also:Terms of Use |Privacy Policy |Imprint

    dblp was originally created in 1993 at:

    University of Trier  

    since 2018, dblp has been operated and maintained by:

    Schloss Dagstuhl - Leibniz Center for Informatics  

    the dblp computer science bibliography is funded and supported by:

    BMBF  RLP  SL  Leibniz  DFG  NFDI  

    [8]ページ先頭

    ©2009-2025 Movatter.jp