![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Saulo Queiroz
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Saulo Queiroz, João P. Vilela, Edmundo Monteiro:
Fast Computation of the Discrete Fourier Transform Square Index Coefficients. CoRR abs/2407.00182 (2024) - [i6]Saulo Queiroz, João P. Vilela, Benjamin Koon Kei Ng, Chan-Tong Lam, Edmundo Monteiro:
Computational Complexity-Constrained Spectral Efficiency Analysis for 6G Waveforms. CoRR abs/2407.05805 (2024) - 2023
- [i5]Saulo Queiroz
, João P. Vilela, Edmundo Monteiro:
Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity. CoRR abs/2310.05794 (2023) - 2022
- [j6]Saulo Queiroz
, João P. Vilela
, Edmundo Monteiro
:
Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals. IEEE Access 10: 104436-104448 (2022) - 2020
- [j5]Saulo Queiroz
, João P. Vilela, Edmundo Monteiro:
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis. IEEE Access 8: 68365-68378 (2020) - [j4]Saulo Queiroz
, Wesley Silva, João P. Vilela
, Edmundo Monteiro
:
Maximal Spectral Efficiency of OFDM With Index Modulation Under Polynomial Space Complexity. IEEE Wirel. Commun. Lett. 9(5): 679-682 (2020) - [i4]Saulo Queiroz, João P. Vilela, Edmundo Monteiro:
Is FFT Fast Enough for Beyond-5G Communications? CoRR abs/2012.07497 (2020)
2010 – 2019
- 2019
- [c11]Saulo Queiroz
, João P. Vilela, Edmundo Monteiro:
What is the Cost of the Index Selector Task for OFDM with Index Modulation? Wireless Days 2019: 1-8 - [i3]Saulo Queiroz, Wesley Silva, João P. Vilela, Edmundo Monteiro:
Maximal Spectral Efficiency of OFDM with Index Modulation under Polynomial Space Complexity. CoRR abs/1908.02860 (2019) - 2017
- [i2]Saulo Queiroz
:
The Hidden Binary Search Tree: A Balanced Rotation-Free Search Tree in the AVL RAM Model. CoRR abs/1711.07746 (2017) - 2016
- [c10]Saulo Queiroz
, João P. Vilela, Roberto A. Hexsel:
Breaking through the Full-Duplex Wi-Fi capacity gain. NOF 2016: 1-6 - [i1]Saulo Queiroz, João P. Vilela, Roberto A. Hexsel:
Breaking Through the Full-Duplex Wi-Fi Capacity Gain. CoRR abs/1605.09624 (2016) - 2015
- [c9]Saulo Queiroz
, Roberto A. Hexsel:
Translating full duplexity into capacity gains for the high-priority traffic classes of IEEE 802.11. SAC 2015: 634-639 - 2013
- [j3]Saulo Queiroz
:
All-at-Once or Piece-by-Piece: How to Access Wide Channels in WLANs with Channel Width Diversity? IEEE Commun. Lett. 17(11): 2188-2191 (2013) - [j2]Julio H. Soto, Saulo Queiroz
, Michele Nogueira
:
Taxonomy, flexibility, and open issues on pue attack defenses in cognitive radio networks. IEEE Wirel. Commun. 20(6): 59-65 (2013) - [c8]Julio H. Soto, Saulo Queiroz
, Maria Gregori, Michele Nogueira
:
A flexible multi-criteria scheme to detect primary user emulation attacks in CRAHNs. WOWMOM 2013: 1-6 - 2012
- [c7]Julio H. Soto, Saulo Queiroz, Michele Nogueira:
Managing sensing and cooperation to analyze PUE attacks in Cognitive Radio Ad Hoc Networks. CNSM 2012: 219-223
2000 – 2009
- 2009
- [c6]Andrea Giordanna Oliveira do Nascimento, Edjair de Souza Mota
, Saulo Jorge Beltrao de Queiroz
, Edson do Nascimento Jr.:
An Alternative Approach for Header Compression Over Wireless Mesh Networks. AINA Workshops 2009: 165-169 - [c5]Joao Luis Gomes Moreira, Edjair de Souza Mota
, Edson Nascimento Silva Jr., Leandro S. G. de Carvalho
, Saulo Queiroz
, Christian Hoene:
Voice over Wireless Mesh Networks: A Case Study in the Brazilian Amazon Region during the Rainy Season. AINA Workshops 2009: 389-394 - [c4]Andrea Giordanna Oliveira do Nascimento, Edjair de Souza Mota, Saulo Queiroz
, Leandro Galvão, Edson Nascimento Silva Jr.:
Towards an efficient header compression scheme to improve VoIP over wireless mesh networks. ISCC 2009: 170-175 - 2008
- [j1]Saulo Queiroz
, Arlen Nascimento, Edjair de Souza Mota
, Leandro S. G. de Carvalho
, Edson Nascimento Silva Jr.:
Comparative analysis of routing protocols for VoIP in a Wireless Mesh Backbone: a user perspective. Int. J. Internet Protoc. Technol. 3(4): 216-223 (2008) - [c3]Arlen Nascimento, Edjair de Souza Mota
, Saulo Queiroz
, Edson Nascimento Silva Jr.:
Header compression for VoIP over multi-hop wireless mesh networks. ISCC 2008: 286-291 - [c2]Saulo Queiroz
, Arlen Nascimento, Edjair de Souza Mota
, Andrea Oliveira, Leandro Galvão, Edson Nascimento Silva Jr.:
Impact evaluation of radio propagation models on performance parameters of application layer in Wireless Mesh Backbone simulation. ISCC 2008: 566-571 - [c1]Arlen Nascimento, Saulo Queiroz, Leandro Galvão, Edjair de Souza Mota, Edson Nascimento Silva Jr.:
Influence of Propagation Modeling on VoIP Quality Performance in Wireless Mesh Network Simulation. MASCOTS 2008: 371-373
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.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 the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.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 the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
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 of crossref.org, opencitations.net, and semanticscholar.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 the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.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 the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.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 by OpenAlex.
last updated on 2024-08-25 19:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint