Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 56 matches
- 1994
- Sridhar Alagar, Subbarayan Venkatesan:
An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. Inf. Process. Lett. 50(6): 311-316 (1994) - M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994) - Yossi Azar, Andrei Z. Broder, Alan M. Frieze:
On the Problem of Approximating the Number of Bases of a Matroid. Inf. Process. Lett. 50(1): 9-11 (1994) - Roberto Baldoni, Bruno Ciciani:
Distributed Algorithms for Multiple Entries to a Critical Section with Priority. Inf. Process. Lett. 50(3): 165-172 (1994) - Ferruccio Barsi, Maria Cristina Pinotti:
A Fully Parallel Algorithm for Residue to Binary Conversion. Inf. Process. Lett. 50(1): 1-8 (1994) - Yair Bartal, Howard J. Karloff, Yuval Rabani:
A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994) - Simon Y. Berkovich:
Multiprocessor Interconnection Network Using Pairwise Balanced Combinatorial Designs. Inf. Process. Lett. 50(4): 217-222 (1994) - Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 50(6): 289-292 (1994) - Her-Kun Chang, Shyan-Ming Yuan:
Message Complexity of Hierarchical Quorum Consensus Algorithm. Inf. Process. Lett. 50(2): 69-73 (1994) - Y. L. Chen:
Finding the k Quickset Simple Paths in a Network. Inf. Process. Lett. 50(2): 89-92 (1994) - Pierre Collette:
An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications. Inf. Process. Lett. 50(1): 31-35 (1994) - Giovanni Di Crescenzo, Giuseppe Persiano:
Round-Optimal Perfect Zero-Knowledge Proofs. Inf. Process. Lett. 50(2): 93-99 (1994) - Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. 50(1): 19-23 (1994) - Narsingh Deo, Amit Jain, Muralidhar Medidi:
An Optimal Parallel Algorithm for Merging Using Multiselection. Inf. Process. Lett. 50(2): 81-87 (1994) - Dhananjay M. Dhamdhere, Sandeep S. Kulkarni:
A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems. Inf. Process. Lett. 50(3): 151-157 (1994) - Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently. Inf. Process. Lett. 50(3): 123-127 (1994) - Yuzheng Ding, Mark Allen Weiss:
On the Complexity of Building an Interval Heap. Inf. Process. Lett. 50(3): 143-144 (1994) - Paolo Ferragina:
Static and Dynamic Parallel Computation of Connected Components. Inf. Process. Lett. 50(2): 63-68 (1994) - Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena:
Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994) - José Fortes Gálvez:
A Note on a Proposed LALR Parser for Extended Context-Free Grammars. Inf. Process. Lett. 50(6): 303-305 (1994) - Jordan Gergov, Christoph Meinel:
On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Inf. Process. Lett. 50(6): 317-322 (1994) - Himabindu Gurla:
Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting. Inf. Process. Lett. 50(2): 111 (1994) - Sorin Istrail, Dejan Zivkovic:
Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC0. Inf. Process. Lett. 50(4): 211-216 (1994) - Shuji Jimbo, Akira Maruoka:
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. Inf. Process. Lett. 50(5): 277-282 (1994) - Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50(1): 49-55 (1994) - Yong-Seok Kim:
An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks. Inf. Process. Lett. 50(1): 43-38 (1994) - Dongseung Kim, Seung-Hoon Kim:
O(log n) Numerical Algorithms on a Mesh with Wormhole Routing. Inf. Process. Lett. 50(3): 129-136 (1994) - G. Prem Kumar, G. Phanendra Babu:
Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming. Inf. Process. Lett. 50(3): 145-149 (1994) - Huade Li:
Trajectory Planning in H-Space. Inf. Process. Lett. 50(5): 253-258 (1994) - Yi-Bing Lin:
Determining the Global Progress of Parallel Simulation with FIFO Communication Property. Inf. Process. Lett. 50(1): 13-17 (1994)
skipping 26 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-07-25 09:09 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint