default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 41
Volume 41, Number 1, November 2004
- Hosam M. Mahmoud
:
Random sprouts as internet models, and Pólya processes. 1-18 - Symeon Bozapalidis, Antonios Kalampakas:
An axiomatization of graphs. 19-61 - Hosam M. Mahmoud:
Erratum: The size of random bucket trees via urn models. 63
Volume 41, Numbers 2-3, December 2004
- SungSuk Kim, Sun Ok Yang, SangKeun Lee:
Maintaining mobile transactional consistency in hybrid broadcast environments. 65-81 - Alexander Grigoriev, Gerhard J. Woeginger:
Project scheduling with irregular costs: complexity, approximability, and algorithms. 83-97 - Hosam M. Mahmoud, Tatsuie Tsukiji:
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. 99-110 - Artiom Alhazov, Linqiang Pan, Gheorghe Paun:
Trading polarizations for labels in P systems with active membranes. 111-144 - Pierluigi Frisco, Hendrik Jan Hoogeboom:
P systems with symport/antiport simulating counter automata. 145-170 - Zheng-Zhu Li, Y. S. Tsai:
Three-element codes with one d-primitive word. 171-180
Volume 41, Number 4-5, March 2005
- Dominic Duggan:
Type-based hot swapping of running modules. 181-220 - Michael G. Lamoureux, Bradford G. Nickerson:
A deterministic skip list for k-dimensional range search. 221-255 - Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana:
Hybrid networks of evolutionary processors are computationally complete. 257-272 - Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro:
Fast allocation and deallocation with an improved buddy system. 273-291 - Christophe Morvan, Chloe Rispal:
Families of automata characterizing context-sensitive languages. 293-314
Volume 41, Number 6, May 2005
- Yiwei Jiang, Yong He:
Preemptive online algorithms for scheduling with machine cost. 315-340 - Kamilla Klonowska, Håkan Lennerstad, Lars Lundberg, Charlie Svahnberg:
Optimal recovery schemes in fault tolerant distributed computing. 341-365 - Stijn Vansummeren:
On the complexity of deciding typability in the relational algebra. 367-381
Volume 41, Number 7-8, June 2005
- Yifeng Chen, Jeff W. Sanders:
The weakest specifunction. 383-414 - Antonín Kucera, Jan Strejcek:
The stuttering principle revisited. 415-434 - Paolo Zuliani:
Compiling quantum programs. 435-474 - Ingo Schmitt, Gunter Saake:
A comprehensive database schema integration method based on the theory of formal concepts. 475-524
Volume 41, Number 9, October 2005
- Mingsheng Ying:
pi-calculus with noisy channels. 525-593 - Leah Epstein, Rob van Stee:
Online square and cube packing. 595-606
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.
last updated on 2024-12-13 19:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
