Citations per year, relative to Lubomir Bic Lubomir Bic (= 1×)
peers
Akshat Verma
Countries citing papers authored by Lubomir Bic
Since
Specialization
Citations
This map shows the geographic impact of Lubomir Bic'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 Lubomir Bic with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lubomir Bic more than expected).
This network shows the impact of papers produced by Lubomir Bic. 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 Lubomir Bic. The network helps show where Lubomir Bic may publish in the future.
Co-authorship network of co-authors of Lubomir Bic
This figure shows the co-authorship network connecting the top 25 collaborators of Lubomir Bic.
A scholar is included among the top collaborators of Lubomir Bic 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 Lubomir Bic. Lubomir Bic is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bic, Lubomir, et al.. (2002). Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data.. 453–458.1 indexed citations
4.
Fukuda, Munehiro, et al.. (2001). Messengers: Distributed Programming Using Mobile Agents. 5(4). 95–112.8 indexed citations
5.
Bic, Lubomir, et al.. (2001). Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. Proceedings of the International Conference on Parallel Processing. 77–86.1 indexed citations
Fukuda, Munehiro, et al.. (1999). Introducing Dynamic Data Structure into Mobile Agents.. Parallel and Distributed Processing Techniques and Applications. 1854–1860.2 indexed citations
Bic, Lubomir, Paraskevas Evripidou, W. Böhm, & Jean‐Luc Gaudiot. (1995). Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques. International Conference on Parallel Architectures and Compilation Techniques.3 indexed citations
12.
Bic, Lubomir, et al.. (1995). Parallel architectures and compilation techniques.27 indexed citations
13.
Blough, Douglas M., et al.. (1993). Incorporating Recovery in Performability Models for Multi-Computer Systems. 126–131.1 indexed citations
14.
Bic, Lubomir. (1992). A process-oriented model for efficient execution of dataflow programs. eScholarship (California Digital Library). 332–347.
15.
Rundensteiner, Elke A., et al.. (1991). Restricting Is-A Related Groupings Using Object Equivalence. 136–145.2 indexed citations
16.
Bic, Lubomir, et al.. (1989). Improving parallel program performance using critical path analysis. eScholarship (California Digital Library).3 indexed citations
17.
Rundensteiner, Elke A. & Lubomir Bic. (1989). Aggregates in possibilistic databases. Very Large Data Bases. 287–295.13 indexed citations
18.
Bic, Lubomir & Alan Shaw. (1988). The logical design of operating systems (2nd ed.). Prentice-Hall, Inc eBooks.5 indexed citations
Bic, Lubomir. (1984). A Data-Driven Model for Parallel Interpretation of Logic Programs.. Future Generation Computer Systems. 517–523.8 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.