T. Schimming

484 total citations
30 papers, 359 citations indexed

About

T. Schimming is a scholar working on Statistical and Nonlinear Physics, Computer Vision and Pattern Recognition and Computational Theory and Mathematics. According to data from OpenAlex, T. Schimming has authored 30 papers receiving a total of 359 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Statistical and Nonlinear Physics, 13 papers in Computer Vision and Pattern Recognition and 13 papers in Computational Theory and Mathematics. Recurrent topics in T. Schimming's work include Chaos control and synchronization (21 papers), Chaos-based Image/Signal Encryption (13 papers) and Cellular Automata and Applications (13 papers). T. Schimming is often cited by papers focused on Chaos control and synchronization (21 papers), Chaos-based Image/Signal Encryption (13 papers) and Cellular Automata and Applications (13 papers). T. Schimming collaborates with scholars based in Switzerland, Italy and Germany. T. Schimming's co-authors include M. Hasler, Martin Hasler, H. Dedieu, Marco Götz, Wolfgang Schwarz, O. De Feo, Federico Bizzarri and Maciej Ogorzałek and has published in prestigious journals such as Proceedings of the IEEE, International Journal of Bifurcation and Chaos and IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications.

In The Last Decade

T. Schimming

26 papers receiving 323 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
T. Schimming Switzerland 9 312 206 154 117 81 30 359
L. Cardoza-Avendaño Mexico 8 157 0.5× 226 1.1× 87 0.6× 59 0.5× 32 0.4× 14 324
F. Dachselt Germany 4 163 0.5× 246 1.2× 82 0.5× 47 0.4× 39 0.5× 7 289
Khaled Benkouider Algeria 10 219 0.7× 137 0.7× 40 0.3× 78 0.7× 14 0.2× 36 306
Hamid Hamiche Algeria 12 261 0.8× 193 0.9× 35 0.2× 149 1.3× 11 0.1× 34 355
H.S. Kwok Hong Kong 4 104 0.3× 375 1.8× 120 0.8× 20 0.2× 21 0.3× 9 399
Cuauhtémoc Mancillas-López Mexico 8 85 0.3× 193 0.9× 56 0.4× 35 0.3× 26 0.3× 23 260
Le Feng China 5 96 0.3× 499 2.4× 129 0.8× 33 0.3× 43 0.5× 7 554
Xue Qin China 3 108 0.3× 613 3.0× 178 1.2× 16 0.1× 63 0.8× 8 647
Dieter Mitsche France 10 77 0.2× 14 0.1× 123 0.8× 115 1.0× 13 0.2× 56 293
Adrian-Viorel Diaconu Romania 7 67 0.2× 471 2.3× 113 0.7× 13 0.1× 50 0.6× 16 492

Countries citing papers authored by T. Schimming

Since Specialization
Citations

This map shows the geographic impact of T. Schimming's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by T. Schimming with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T. Schimming more than expected).

Fields of papers citing papers by T. Schimming

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by T. Schimming. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by T. Schimming. The network helps show where T. Schimming may publish in the future.

Co-authorship network of co-authors of T. Schimming

This figure shows the co-authorship network connecting the top 25 collaborators of T. Schimming. A scholar is included among the top collaborators of T. Schimming based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with T. Schimming. T. Schimming is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Schimming, T., et al.. (2003). How to repair CSK using small perturbation control - Case study and performance analysis. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 3. 249–252. 4 indexed citations
2.
Schimming, T., et al.. (2003). Optimal receiver for ergodic chaos shift keying. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 3. III–879. 1 indexed citations
3.
Hasler, M. & T. Schimming. (2003). Potential of chaos communication over noisy channels - channel coding using chaotic piecewise linear maps. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 4. IV–568. 16 indexed citations
4.
Schimming, T., et al.. (2003). Minimum distance properties of coded modulations based on iterated chaotic maps. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1. 141–144. 8 indexed citations
5.
Schimming, T.. (2002). Statistical analysis and optimization of chaos based broadband communications. Infoscience (Ecole Polytechnique Fédérale de Lausanne).
6.
Schimming, T., et al.. (2002). Coded Modulations Using Chaotic Systems Controlled by Small Perturbations. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1. 49–52. 2 indexed citations
7.
Schimming, T.. (2002). Chaos based modulations from an information theory perspective. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2. 309–312. 6 indexed citations
8.
Schimming, T. & Martin Hasler. (2001). Comparison of different chaos shift keying methods. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 185–188. 3 indexed citations
9.
Schimming, T., et al.. (2001). Symbolic dynamics for processing chaotic signal. II. Communication and coding. IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications. 48(11). 1283–1295. 37 indexed citations
10.
Schimming, T., et al.. (2001). Symbolic dynamics for processing chaotic signals. I. Noise reduction of chaotic sequences. IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications. 48(11). 1269–1282. 37 indexed citations
11.
Dedieu, H., et al.. (2001). Maximum likelihood approaches for noncoherent communications with chaotic carriers. IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications. 48(5). 533–542. 29 indexed citations
12.
Schimming, T. & Martin Hasler. (2000). Chaos communication in the presence of channel noise. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 4(1). 21–28. 1 indexed citations
13.
Schimming, T.. (2000). Reduced complexity likelihood approximation for chaotic trajectory segments. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1. 389–392. 2 indexed citations
14.
Schimming, T., et al.. (2000). Nonlinear structures in voiced speech signals. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1. 727–730. 1 indexed citations
15.
Schimming, T. & M. Hasler. (2000). Optimal detection of differential chaos shift keying. IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications. 47(12). 1712–1719. 34 indexed citations
16.
Schimming, T. & M. Hasler. (1999). Constrained and unconstrained noise reduction on chaotic trajectories. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1. 179–182. 4 indexed citations
17.
Dedieu, H., T. Schimming, & M. Hasler. (1999). Separating a chaotic signal from noise and applications. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 457–476. 6 indexed citations
18.
Schimming, T. & M. Hasler. (1999). Statistically motivated detection methods for chaos shift keying. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 569–572. 7 indexed citations
19.
Schimming, T., et al.. (1998). Chaos communication from a maximum likelihood perspective. The International Journal of Applied Radiation and Isotopes. 1. 77–80. 6 indexed citations
20.
Schimming, T., Marco Götz, & Wolfgang Schwarz. (1998). Signal Modeling Using Piecewise Linear Chaotic Generators. INFM-OAR (INFN Catania). 3. 1–4. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026