Person:682666: Difference between revisions

From MaRDI portal
Person:682666
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Peter Eliaš to Peter Eliaš: Duplicate
 
(No difference)

Latest revision as of 17:05, 12 December 2023

Available identifiers

zbMath Open elias.peterWikidataQ102344394 ScholiaQ102344394MaRDI QIDQ682666

List of research outcomes

PublicationDate of PublicationType
Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets2023-10-31Paper
Connecting concept lattices with bonds induced by external information2023-09-22Paper
Conditional probability on full Łukasiewicz tribes2022-07-11Paper
Divisible extension of probability2021-01-21Paper
A Galois connection related to restrictions of continuous real functions2019-09-11Paper
Factorization of observables2018-02-05Paper
On the Convergence of a Mapped by a Function2015-06-08Paper
Dirichlet sets, Erdős-Kunen-Mauldin theorem, and analytic subgroups of the reals2011-06-09Paper
Dirichlet sets and Erdos-Kunen-Mauldin theorem2007-12-13Paper
https://portal.mardi4nfdi.de/entity/Q33690212006-02-10Paper
https://portal.mardi4nfdi.de/entity/Q48284652004-11-19Paper
Covering for category and trigonometric thin sets2003-07-28Paper
A hierarchy of thin sets related to the boundedness of trigonometric series2000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q43558321997-11-16Paper
https://portal.mardi4nfdi.de/entity/Q48572301997-06-19Paper
A classification of trigonometrical thin sets and their interrelations1997-04-08Paper
Error-correcting codes for list decoding1991-01-01Paper
Zero error capacity under list decoding1989-01-01Paper
Interval and recency rank source coding: Two on-line adaptive variable-length schemes1987-01-01Paper
Minimax optimal universal codeword sets1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41410931977-01-01Paper
Complexity of acceptors for prefix codes (Corresp.)1976-01-01Paper
Universal codeword sets and representations of the integers1975-01-01Paper
Distinguishable codeword sets for shared memory1975-01-01Paper
The Complexity of Some Simple Retrieval Problems1975-01-01Paper
Minimum times and memories needed to compute the values of a function1974-01-01Paper
The Noisy Channel Coding Theorem for Erasure Channels1974-01-01Paper
Efficient Storage and Retrieval by Content and Address of Static Files1974-01-01Paper
A note on the \(\varepsilon\)-entropy of monotone functions in the Levy norm1973-01-01Paper
The Efficient Construction of an Unbiased Random Sequence1972-01-01Paper
Bounds on performance of optimum quantizers1970-01-01Paper
Bounds and Asymptotes for the Performance of Multivariate Quantizers1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56264871970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55849951968-01-01Paper
Networks of Gaussian channels with applications to feedback systems1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57364481963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57226071962-01-01Paper
URSI National Committee Report: Commission 6. Radio Waves and Circuits. Part 1. Information Theory and Coding1960-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Peter Eliaš